./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8 --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 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- 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-2329fc7 [2022-12-13 13:35:35,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:35:35,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:35:35,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:35:35,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:35:35,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:35:35,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:35:35,582 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:35:35,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:35:35,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:35:35,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:35:35,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:35:35,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:35:35,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:35:35,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:35:35,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:35:35,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:35:35,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:35:35,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:35:35,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:35:35,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:35:35,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:35:35,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:35:35,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:35:35,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:35:35,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:35:35,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:35:35,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:35:35,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:35:35,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:35:35,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:35:35,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:35:35,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:35:35,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:35:35,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:35:35,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:35:35,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:35:35,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:35:35,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:35:35,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:35:35,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:35:35,603 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 13:35:35,619 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:35:35,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:35:35,619 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:35:35,619 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:35:35,620 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:35:35,620 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:35:35,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:35:35,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:35:35,620 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:35:35,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:35:35,621 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:35:35,621 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:35:35,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:35:35,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:35:35,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:35:35,621 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 13:35:35,621 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 13:35:35,621 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 13:35:35,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:35:35,622 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 13:35:35,622 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:35:35,622 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:35:35,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:35:35,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:35:35,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:35:35,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:35:35,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:35:35,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:35:35,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:35:35,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:35:35,623 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:35:35,623 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:35:35,623 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:35:35,623 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:35:35,623 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_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/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_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8 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 -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2022-12-13 13:35:35,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:35:35,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:35:35,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:35:35,803 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:35:35,803 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:35:35,804 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/forester-heap/dll-optional-1.i [2022-12-13 13:35:38,400 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:35:38,551 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:35:38,551 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/sv-benchmarks/c/forester-heap/dll-optional-1.i [2022-12-13 13:35:38,559 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/data/a22c344f1/1a98530d5a014b659ce962042c366818/FLAG63525c8d2 [2022-12-13 13:35:38,568 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/data/a22c344f1/1a98530d5a014b659ce962042c366818 [2022-12-13 13:35:38,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:35:38,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:35:38,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:35:38,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:35:38,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:35:38,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:35:38" (1/1) ... [2022-12-13 13:35:38,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18105593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:38, skipping insertion in model container [2022-12-13 13:35:38,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:35:38" (1/1) ... [2022-12-13 13:35:38,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:35:38,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:35:38,821 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2022-12-13 13:35:38,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:35:38,838 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:35:38,877 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2022-12-13 13:35:38,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:35:38,911 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:35:38,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:38 WrapperNode [2022-12-13 13:35:38,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:35:38,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:35:38,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:35:38,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:35:38,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:38" (1/1) ... [2022-12-13 13:35:38,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:38" (1/1) ... [2022-12-13 13:35:38,956 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 140 [2022-12-13 13:35:38,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:35:38,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:35:38,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:35:38,957 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:35:38,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:38" (1/1) ... [2022-12-13 13:35:38,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:38" (1/1) ... [2022-12-13 13:35:38,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:38" (1/1) ... [2022-12-13 13:35:38,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:38" (1/1) ... [2022-12-13 13:35:38,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:38" (1/1) ... [2022-12-13 13:35:38,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:38" (1/1) ... [2022-12-13 13:35:38,985 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:38" (1/1) ... [2022-12-13 13:35:38,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:38" (1/1) ... [2022-12-13 13:35:38,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:35:38,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:35:38,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:35:38,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:35:38,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:38" (1/1) ... [2022-12-13 13:35:38,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:35:39,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:35:39,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:35:39,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:35:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:35:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:35:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 13:35:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:35:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 13:35:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 13:35:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:35:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:35:39,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:35:39,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:35:39,123 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:35:39,124 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:35:39,458 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:35:39,466 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:35:39,466 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-13 13:35:39,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:35:39 BoogieIcfgContainer [2022-12-13 13:35:39,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:35:39,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:35:39,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:35:39,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:35:39,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:35:38" (1/3) ... [2022-12-13 13:35:39,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d2543c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:35:39, skipping insertion in model container [2022-12-13 13:35:39,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:38" (2/3) ... [2022-12-13 13:35:39,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d2543c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:35:39, skipping insertion in model container [2022-12-13 13:35:39,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:35:39" (3/3) ... [2022-12-13 13:35:39,473 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2022-12-13 13:35:39,487 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:35:39,487 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-12-13 13:35:39,519 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:35:39,523 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;@7de44a2e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:35:39,523 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-12-13 13:35:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 80 states have (on average 2.1125) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:39,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 13:35:39,530 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:39,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 13:35:39,531 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:39,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:39,535 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-12-13 13:35:39,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:39,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488890394] [2022-12-13 13:35:39,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:39,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:39,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:39,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488890394] [2022-12-13 13:35:39,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488890394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:39,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:39,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:35:39,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88946769] [2022-12-13 13:35:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:39,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:35:39,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:39,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:35:39,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:35:39,706 INFO L87 Difference]: Start difference. First operand has 153 states, 80 states have (on average 2.1125) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:39,853 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2022-12-13 13:35:39,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:35:39,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-13 13:35:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:39,862 INFO L225 Difference]: With dead ends: 154 [2022-12-13 13:35:39,862 INFO L226 Difference]: Without dead ends: 150 [2022-12-13 13:35:39,863 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-12-13 13:35:39,866 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:39,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 87 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:35:39,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-12-13 13:35:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2022-12-13 13:35:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 82 states have (on average 1.9024390243902438) internal successors, (156), 143 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2022-12-13 13:35:39,893 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 3 [2022-12-13 13:35:39,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:39,894 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2022-12-13 13:35:39,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:39,894 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2022-12-13 13:35:39,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 13:35:39,894 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:39,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 13:35:39,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:35:39,895 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:39,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:39,895 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-12-13 13:35:39,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:39,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561441755] [2022-12-13 13:35:39,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:39,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:39,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:39,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561441755] [2022-12-13 13:35:39,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561441755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:39,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:39,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:35:39,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113565258] [2022-12-13 13:35:39,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:39,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:35:39,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:39,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:35:39,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:35:39,959 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:40,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:40,063 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2022-12-13 13:35:40,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:35:40,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-13 13:35:40,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:40,065 INFO L225 Difference]: With dead ends: 139 [2022-12-13 13:35:40,065 INFO L226 Difference]: Without dead ends: 139 [2022-12-13 13:35:40,065 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-12-13 13:35:40,067 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 113 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:40,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 100 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:35:40,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-13 13:35:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2022-12-13 13:35:40,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 82 states have (on average 1.7926829268292683) internal successors, (147), 134 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:40,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2022-12-13 13:35:40,073 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 3 [2022-12-13 13:35:40,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:40,073 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2022-12-13 13:35:40,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:40,073 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2022-12-13 13:35:40,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 13:35:40,074 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:40,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:40,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:35:40,074 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:40,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:40,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656077, now seen corresponding path program 1 times [2022-12-13 13:35:40,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:40,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000691895] [2022-12-13 13:35:40,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:40,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:40,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:40,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000691895] [2022-12-13 13:35:40,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000691895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:40,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:40,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:35:40,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322126210] [2022-12-13 13:35:40,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:40,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:35:40,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:40,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:35:40,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:35:40,250 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:40,432 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2022-12-13 13:35:40,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:35:40,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-13 13:35:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:40,434 INFO L225 Difference]: With dead ends: 179 [2022-12-13 13:35:40,434 INFO L226 Difference]: Without dead ends: 179 [2022-12-13 13:35:40,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:35:40,435 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 52 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:40,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 330 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:35:40,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-12-13 13:35:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 134. [2022-12-13 13:35:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 82 states have (on average 1.7804878048780488) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2022-12-13 13:35:40,444 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 12 [2022-12-13 13:35:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:40,444 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-12-13 13:35:40,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-12-13 13:35:40,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 13:35:40,445 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:40,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:40,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:35:40,445 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:40,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:40,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656076, now seen corresponding path program 1 times [2022-12-13 13:35:40,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:40,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805419157] [2022-12-13 13:35:40,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:40,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:40,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:40,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805419157] [2022-12-13 13:35:40,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805419157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:40,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:40,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:35:40,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108428830] [2022-12-13 13:35:40,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:40,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:35:40,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:40,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:35:40,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:35:40,648 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:40,801 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2022-12-13 13:35:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:35:40,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-13 13:35:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:40,802 INFO L225 Difference]: With dead ends: 133 [2022-12-13 13:35:40,802 INFO L226 Difference]: Without dead ends: 133 [2022-12-13 13:35:40,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:35:40,803 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 3 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:40,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 366 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:35:40,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-12-13 13:35:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-12-13 13:35:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.7682926829268293) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 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-12-13 13:35:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-12-13 13:35:40,807 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 12 [2022-12-13 13:35:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:40,807 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-12-13 13:35:40,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-12-13 13:35:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 13:35:40,808 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:40,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:40,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:35:40,808 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:40,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:40,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115696, now seen corresponding path program 1 times [2022-12-13 13:35:40,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:40,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070218802] [2022-12-13 13:35:40,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:40,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:40,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:40,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070218802] [2022-12-13 13:35:40,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070218802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:40,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:40,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:35:40,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585316620] [2022-12-13 13:35:40,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:40,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:35:40,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:40,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:35:40,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:35:40,894 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:41,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:41,012 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-12-13 13:35:41,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:35:41,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 13:35:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:41,014 INFO L225 Difference]: With dead ends: 134 [2022-12-13 13:35:41,014 INFO L226 Difference]: Without dead ends: 134 [2022-12-13 13:35:41,014 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-12-13 13:35:41,015 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 186 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:41,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 75 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:35:41,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-12-13 13:35:41,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2022-12-13 13:35:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.6136363636363635) internal successors, (142), 124 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2022-12-13 13:35:41,019 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 13 [2022-12-13 13:35:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:41,020 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2022-12-13 13:35:41,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-12-13 13:35:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2022-12-13 13:35:41,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 13:35:41,020 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:41,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:41,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:35:41,021 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:41,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:41,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115697, now seen corresponding path program 1 times [2022-12-13 13:35:41,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:41,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976421713] [2022-12-13 13:35:41,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:41,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:41,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:41,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976421713] [2022-12-13 13:35:41,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976421713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:41,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:41,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:35:41,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812483385] [2022-12-13 13:35:41,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:41,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:35:41,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:41,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:35:41,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:35:41,130 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:41,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:41,277 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2022-12-13 13:35:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:35:41,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 13:35:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:41,278 INFO L225 Difference]: With dead ends: 182 [2022-12-13 13:35:41,278 INFO L226 Difference]: Without dead ends: 182 [2022-12-13 13:35:41,279 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-12-13 13:35:41,280 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 190 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:41,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 118 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:35:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-12-13 13:35:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 156. [2022-12-13 13:35:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 155 states have internal predecessors, (183), 0 states have call successors, (0), 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-12-13 13:35:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2022-12-13 13:35:41,287 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 13 [2022-12-13 13:35:41,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:41,287 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2022-12-13 13:35:41,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-12-13 13:35:41,288 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2022-12-13 13:35:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 13:35:41,288 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:41,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:41,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:35:41,289 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:41,289 INFO L85 PathProgramCache]: Analyzing trace with hash -288943149, now seen corresponding path program 1 times [2022-12-13 13:35:41,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:41,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745616421] [2022-12-13 13:35:41,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:41,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:41,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:41,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745616421] [2022-12-13 13:35:41,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745616421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:41,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:41,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:35:41,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308835544] [2022-12-13 13:35:41,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:41,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:35:41,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:41,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:35:41,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:35:41,357 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-12-13 13:35:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:41,481 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2022-12-13 13:35:41,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:35:41,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-12-13 13:35:41,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:41,482 INFO L225 Difference]: With dead ends: 155 [2022-12-13 13:35:41,482 INFO L226 Difference]: Without dead ends: 155 [2022-12-13 13:35:41,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:35:41,483 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 10 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:41,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 308 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:35:41,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-13 13:35:41,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-12-13 13:35:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 119 states have (on average 1.5210084033613445) internal successors, (181), 154 states have internal predecessors, (181), 0 states have call successors, (0), 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-12-13 13:35:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2022-12-13 13:35:41,489 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 16 [2022-12-13 13:35:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:41,489 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2022-12-13 13:35:41,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-12-13 13:35:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2022-12-13 13:35:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 13:35:41,490 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:41,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:41,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:35:41,490 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:41,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:41,491 INFO L85 PathProgramCache]: Analyzing trace with hash -288943148, now seen corresponding path program 1 times [2022-12-13 13:35:41,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:41,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117661633] [2022-12-13 13:35:41,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:41,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:41,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:41,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117661633] [2022-12-13 13:35:41,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117661633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:41,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:41,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:35:41,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268753004] [2022-12-13 13:35:41,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:41,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:35:41,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:41,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:35:41,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:35:41,656 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-12-13 13:35:41,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:41,803 INFO L93 Difference]: Finished difference Result 154 states and 179 transitions. [2022-12-13 13:35:41,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:35:41,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-12-13 13:35:41,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:41,804 INFO L225 Difference]: With dead ends: 154 [2022-12-13 13:35:41,805 INFO L226 Difference]: Without dead ends: 154 [2022-12-13 13:35:41,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:35:41,806 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 5 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:41,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 299 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:35:41,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-12-13 13:35:41,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-12-13 13:35:41,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.504201680672269) internal successors, (179), 153 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-12-13 13:35:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2022-12-13 13:35:41,811 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 16 [2022-12-13 13:35:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:41,811 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2022-12-13 13:35:41,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-12-13 13:35:41,811 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2022-12-13 13:35:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 13:35:41,812 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:41,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:41,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:35:41,812 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:41,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:41,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1504363226, now seen corresponding path program 1 times [2022-12-13 13:35:41,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:41,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745896122] [2022-12-13 13:35:41,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:41,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:41,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:41,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745896122] [2022-12-13 13:35:41,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745896122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:41,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:41,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:35:41,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3946237] [2022-12-13 13:35:41,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:41,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:35:41,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:41,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:35:41,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:35:41,849 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 4 states, 4 states have (on average 4.5) 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-12-13 13:35:41,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:41,940 INFO L93 Difference]: Finished difference Result 173 states and 192 transitions. [2022-12-13 13:35:41,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:35:41,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) 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-12-13 13:35:41,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:41,942 INFO L225 Difference]: With dead ends: 173 [2022-12-13 13:35:41,942 INFO L226 Difference]: Without dead ends: 173 [2022-12-13 13:35:41,942 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-12-13 13:35:41,943 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 176 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:41,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 168 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:35:41,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-12-13 13:35:41,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2022-12-13 13:35:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.4873949579831933) internal successors, (177), 153 states have internal predecessors, (177), 0 states have call successors, (0), 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-12-13 13:35:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2022-12-13 13:35:41,947 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 18 [2022-12-13 13:35:41,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:41,947 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2022-12-13 13:35:41,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) 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-12-13 13:35:41,948 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2022-12-13 13:35:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 13:35:41,948 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:41,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:41,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:35:41,949 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:41,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:41,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1253394517, now seen corresponding path program 1 times [2022-12-13 13:35:41,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:41,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640346319] [2022-12-13 13:35:41,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:41,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:42,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:42,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:42,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640346319] [2022-12-13 13:35:42,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640346319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:42,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:42,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:35:42,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597845147] [2022-12-13 13:35:42,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:42,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:35:42,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:42,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:35:42,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:35:42,142 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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-12-13 13:35:42,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:42,402 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2022-12-13 13:35:42,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:35:42,402 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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-12-13 13:35:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:42,403 INFO L225 Difference]: With dead ends: 155 [2022-12-13 13:35:42,403 INFO L226 Difference]: Without dead ends: 155 [2022-12-13 13:35:42,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:35:42,404 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 176 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:42,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 257 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:35:42,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-13 13:35:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2022-12-13 13:35:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 152 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2022-12-13 13:35:42,408 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 20 [2022-12-13 13:35:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:42,408 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2022-12-13 13:35:42,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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-12-13 13:35:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2022-12-13 13:35:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 13:35:42,409 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:42,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:42,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:35:42,410 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:42,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:42,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1253394518, now seen corresponding path program 1 times [2022-12-13 13:35:42,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:42,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958298254] [2022-12-13 13:35:42,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:42,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:42,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:42,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958298254] [2022-12-13 13:35:42,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958298254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:42,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:42,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 13:35:42,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178004159] [2022-12-13 13:35:42,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:42,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:35:42,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:42,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:35:42,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:35:42,704 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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-12-13 13:35:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:43,080 INFO L93 Difference]: Finished difference Result 146 states and 167 transitions. [2022-12-13 13:35:43,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 13:35:43,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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-12-13 13:35:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:43,082 INFO L225 Difference]: With dead ends: 146 [2022-12-13 13:35:43,082 INFO L226 Difference]: Without dead ends: 146 [2022-12-13 13:35:43,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-12-13 13:35:43,083 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 177 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:43,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 264 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:35:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-12-13 13:35:43,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 134. [2022-12-13 13:35:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 111 states have (on average 1.4054054054054055) internal successors, (156), 133 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2022-12-13 13:35:43,086 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 20 [2022-12-13 13:35:43,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:43,086 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2022-12-13 13:35:43,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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-12-13 13:35:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2022-12-13 13:35:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 13:35:43,086 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:43,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:43,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:35:43,087 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:43,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:43,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1737058081, now seen corresponding path program 1 times [2022-12-13 13:35:43,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:43,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16949525] [2022-12-13 13:35:43,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:43,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:43,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:43,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16949525] [2022-12-13 13:35:43,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16949525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:43,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:43,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:35:43,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847839906] [2022-12-13 13:35:43,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:43,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:35:43,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:43,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:35:43,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:35:43,118 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:43,139 INFO L93 Difference]: Finished difference Result 160 states and 190 transitions. [2022-12-13 13:35:43,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:35:43,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-13 13:35:43,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:43,140 INFO L225 Difference]: With dead ends: 160 [2022-12-13 13:35:43,140 INFO L226 Difference]: Without dead ends: 160 [2022-12-13 13:35:43,140 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-12-13 13:35:43,141 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 21 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:43,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 316 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:35:43,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-12-13 13:35:43,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 138. [2022-12-13 13:35:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 115 states have (on average 1.391304347826087) internal successors, (160), 137 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 160 transitions. [2022-12-13 13:35:43,145 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 160 transitions. Word has length 21 [2022-12-13 13:35:43,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:43,145 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 160 transitions. [2022-12-13 13:35:43,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 160 transitions. [2022-12-13 13:35:43,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 13:35:43,146 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:43,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:43,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:35:43,146 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:43,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:43,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1420838518, now seen corresponding path program 1 times [2022-12-13 13:35:43,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:43,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259946877] [2022-12-13 13:35:43,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:43,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:43,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:43,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259946877] [2022-12-13 13:35:43,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259946877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:43,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:43,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:35:43,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410018417] [2022-12-13 13:35:43,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:43,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:35:43,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:43,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:35:43,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:35:43,172 INFO L87 Difference]: Start difference. First operand 138 states and 160 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:43,180 INFO L93 Difference]: Finished difference Result 140 states and 162 transitions. [2022-12-13 13:35:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:35:43,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-13 13:35:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:43,181 INFO L225 Difference]: With dead ends: 140 [2022-12-13 13:35:43,181 INFO L226 Difference]: Without dead ends: 140 [2022-12-13 13:35:43,181 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-12-13 13:35:43,182 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:43,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:35:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-12-13 13:35:43,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-12-13 13:35:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 139 states have internal predecessors, (162), 0 states have call successors, (0), 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-12-13 13:35:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2022-12-13 13:35:43,185 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 23 [2022-12-13 13:35:43,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:43,186 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2022-12-13 13:35:43,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2022-12-13 13:35:43,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 13:35:43,186 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:43,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:43,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:35:43,187 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:43,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:43,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1628462334, now seen corresponding path program 1 times [2022-12-13 13:35:43,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:43,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639470907] [2022-12-13 13:35:43,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:43,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:43,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:43,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639470907] [2022-12-13 13:35:43,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639470907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:43,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:43,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:35:43,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484775346] [2022-12-13 13:35:43,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:43,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:35:43,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:43,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:35:43,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:35:43,300 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) 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-12-13 13:35:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:43,494 INFO L93 Difference]: Finished difference Result 269 states and 312 transitions. [2022-12-13 13:35:43,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:35:43,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) 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-12-13 13:35:43,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:43,496 INFO L225 Difference]: With dead ends: 269 [2022-12-13 13:35:43,496 INFO L226 Difference]: Without dead ends: 269 [2022-12-13 13:35:43,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:35:43,497 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 160 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:43,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 334 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:35:43,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-12-13 13:35:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 154. [2022-12-13 13:35:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 153 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-12-13 13:35:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2022-12-13 13:35:43,503 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 23 [2022-12-13 13:35:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:43,503 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2022-12-13 13:35:43,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) 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-12-13 13:35:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2022-12-13 13:35:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 13:35:43,504 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:43,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:43,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:35:43,505 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:43,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1628462335, now seen corresponding path program 1 times [2022-12-13 13:35:43,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:43,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286253403] [2022-12-13 13:35:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:43,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:43,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:43,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286253403] [2022-12-13 13:35:43,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286253403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:43,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:43,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:35:43,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102153581] [2022-12-13 13:35:43,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:43,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:35:43,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:43,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:35:43,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:35:43,656 INFO L87 Difference]: Start difference. First operand 154 states and 180 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-12-13 13:35:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:43,954 INFO L93 Difference]: Finished difference Result 279 states and 325 transitions. [2022-12-13 13:35:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 13:35:43,954 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-12-13 13:35:43,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:43,955 INFO L225 Difference]: With dead ends: 279 [2022-12-13 13:35:43,955 INFO L226 Difference]: Without dead ends: 279 [2022-12-13 13:35:43,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:35:43,955 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 166 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:43,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 469 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:35:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-12-13 13:35:43,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 150. [2022-12-13 13:35:43,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 149 states have internal predecessors, (174), 0 states have call successors, (0), 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-12-13 13:35:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2022-12-13 13:35:43,958 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 23 [2022-12-13 13:35:43,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:43,958 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2022-12-13 13:35:43,958 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-12-13 13:35:43,959 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2022-12-13 13:35:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 13:35:43,959 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:43,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:43,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:35:43,959 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:43,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:43,959 INFO L85 PathProgramCache]: Analyzing trace with hash 375423567, now seen corresponding path program 1 times [2022-12-13 13:35:43,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:43,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383973106] [2022-12-13 13:35:43,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:43,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:44,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:44,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383973106] [2022-12-13 13:35:44,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383973106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:44,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:44,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:35:44,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347783229] [2022-12-13 13:35:44,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:44,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:35:44,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:44,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:35:44,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:35:44,087 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:44,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:44,357 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2022-12-13 13:35:44,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:35:44,357 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-13 13:35:44,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:44,358 INFO L225 Difference]: With dead ends: 225 [2022-12-13 13:35:44,358 INFO L226 Difference]: Without dead ends: 225 [2022-12-13 13:35:44,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:35:44,358 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 235 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:44,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 360 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:35:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-12-13 13:35:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 156. [2022-12-13 13:35:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 133 states have (on average 1.3609022556390977) internal successors, (181), 155 states have internal predecessors, (181), 0 states have call successors, (0), 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-12-13 13:35:44,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 181 transitions. [2022-12-13 13:35:44,362 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 181 transitions. Word has length 25 [2022-12-13 13:35:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:44,362 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 181 transitions. [2022-12-13 13:35:44,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 181 transitions. [2022-12-13 13:35:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 13:35:44,363 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:44,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:44,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 13:35:44,364 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash 729704446, now seen corresponding path program 1 times [2022-12-13 13:35:44,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:44,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047442720] [2022-12-13 13:35:44,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:44,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:44,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:44,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047442720] [2022-12-13 13:35:44,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047442720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:44,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:44,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:35:44,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855650661] [2022-12-13 13:35:44,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:44,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:35:44,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:44,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:35:44,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:35:44,516 INFO L87 Difference]: Start difference. First operand 156 states and 181 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:44,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:44,881 INFO L93 Difference]: Finished difference Result 318 states and 365 transitions. [2022-12-13 13:35:44,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 13:35:44,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 13:35:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:44,882 INFO L225 Difference]: With dead ends: 318 [2022-12-13 13:35:44,882 INFO L226 Difference]: Without dead ends: 318 [2022-12-13 13:35:44,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-12-13 13:35:44,883 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 360 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:44,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 459 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 13:35:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-12-13 13:35:44,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 169. [2022-12-13 13:35:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 146 states have (on average 1.356164383561644) internal successors, (198), 168 states have internal predecessors, (198), 0 states have call successors, (0), 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-12-13 13:35:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2022-12-13 13:35:44,886 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 27 [2022-12-13 13:35:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:44,886 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2022-12-13 13:35:44,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2022-12-13 13:35:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 13:35:44,887 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:44,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:44,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 13:35:44,887 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:44,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:44,888 INFO L85 PathProgramCache]: Analyzing trace with hash 729704447, now seen corresponding path program 1 times [2022-12-13 13:35:44,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:44,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127642557] [2022-12-13 13:35:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:44,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:45,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:45,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127642557] [2022-12-13 13:35:45,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127642557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:45,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:45,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 13:35:45,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708602751] [2022-12-13 13:35:45,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:45,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:35:45,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:45,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:35:45,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:35:45,162 INFO L87 Difference]: Start difference. First operand 169 states and 198 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:45,591 INFO L93 Difference]: Finished difference Result 251 states and 287 transitions. [2022-12-13 13:35:45,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 13:35:45,592 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 13:35:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:45,592 INFO L225 Difference]: With dead ends: 251 [2022-12-13 13:35:45,592 INFO L226 Difference]: Without dead ends: 251 [2022-12-13 13:35:45,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-12-13 13:35:45,593 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 279 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:45,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 458 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 13:35:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-12-13 13:35:45,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 169. [2022-12-13 13:35:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 168 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-12-13 13:35:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2022-12-13 13:35:45,598 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 27 [2022-12-13 13:35:45,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:45,598 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2022-12-13 13:35:45,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2022-12-13 13:35:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 13:35:45,598 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:45,599 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:45,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 13:35:45,599 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:45,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1443803627, now seen corresponding path program 1 times [2022-12-13 13:35:45,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:45,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053062766] [2022-12-13 13:35:45,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:45,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:45,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:45,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053062766] [2022-12-13 13:35:45,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053062766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:45,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:45,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:35:45,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815711019] [2022-12-13 13:35:45,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:45,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:35:45,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:45,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:35:45,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:35:45,633 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:45,648 INFO L93 Difference]: Finished difference Result 181 states and 210 transitions. [2022-12-13 13:35:45,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:35:45,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 13:35:45,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:45,648 INFO L225 Difference]: With dead ends: 181 [2022-12-13 13:35:45,648 INFO L226 Difference]: Without dead ends: 181 [2022-12-13 13:35:45,649 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-12-13 13:35:45,649 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 10 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:45,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 317 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:35:45,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-12-13 13:35:45,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 173. [2022-12-13 13:35:45,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 172 states have internal predecessors, (200), 0 states have call successors, (0), 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-12-13 13:35:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 200 transitions. [2022-12-13 13:35:45,653 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 200 transitions. Word has length 27 [2022-12-13 13:35:45,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:45,653 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 200 transitions. [2022-12-13 13:35:45,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 200 transitions. [2022-12-13 13:35:45,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 13:35:45,654 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:45,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:45,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 13:35:45,654 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:45,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:45,654 INFO L85 PathProgramCache]: Analyzing trace with hash 17756513, now seen corresponding path program 1 times [2022-12-13 13:35:45,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:45,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902950281] [2022-12-13 13:35:45,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:45,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:45,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:45,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902950281] [2022-12-13 13:35:45,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902950281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:45,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:45,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:35:45,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637319862] [2022-12-13 13:35:45,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:45,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:35:45,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:45,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:35:45,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:35:45,740 INFO L87 Difference]: Start difference. First operand 173 states and 200 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-12-13 13:35:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:45,860 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2022-12-13 13:35:45,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:35:45,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-12-13 13:35:45,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:45,861 INFO L225 Difference]: With dead ends: 182 [2022-12-13 13:35:45,861 INFO L226 Difference]: Without dead ends: 182 [2022-12-13 13:35:45,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:35:45,861 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 11 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:45,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 296 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:35:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-12-13 13:35:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2022-12-13 13:35:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.3266666666666667) internal successors, (199), 171 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-12-13 13:35:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 199 transitions. [2022-12-13 13:35:45,865 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 199 transitions. Word has length 28 [2022-12-13 13:35:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:45,866 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 199 transitions. [2022-12-13 13:35:45,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-12-13 13:35:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 199 transitions. [2022-12-13 13:35:45,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 13:35:45,866 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:45,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:45,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 13:35:45,866 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:45,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:45,867 INFO L85 PathProgramCache]: Analyzing trace with hash 17756514, now seen corresponding path program 1 times [2022-12-13 13:35:45,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:45,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751087952] [2022-12-13 13:35:45,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:45,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:46,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:46,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751087952] [2022-12-13 13:35:46,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751087952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:46,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:46,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:35:46,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218738810] [2022-12-13 13:35:46,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:46,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:35:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:46,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:35:46,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:35:46,038 INFO L87 Difference]: Start difference. First operand 172 states and 199 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-12-13 13:35:46,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:46,178 INFO L93 Difference]: Finished difference Result 171 states and 198 transitions. [2022-12-13 13:35:46,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:35:46,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-12-13 13:35:46,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:46,179 INFO L225 Difference]: With dead ends: 171 [2022-12-13 13:35:46,179 INFO L226 Difference]: Without dead ends: 171 [2022-12-13 13:35:46,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:35:46,180 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 3 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:46,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 282 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:35:46,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-12-13 13:35:46,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-12-13 13:35:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.32) internal successors, (198), 170 states have internal predecessors, (198), 0 states have call successors, (0), 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-12-13 13:35:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2022-12-13 13:35:46,184 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 28 [2022-12-13 13:35:46,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:46,184 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2022-12-13 13:35:46,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-12-13 13:35:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2022-12-13 13:35:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 13:35:46,185 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:46,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:46,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 13:35:46,185 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:46,185 INFO L85 PathProgramCache]: Analyzing trace with hash -42480305, now seen corresponding path program 1 times [2022-12-13 13:35:46,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:46,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269128941] [2022-12-13 13:35:46,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:46,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:46,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:46,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269128941] [2022-12-13 13:35:46,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269128941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:46,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:46,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 13:35:46,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026819609] [2022-12-13 13:35:46,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:46,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:35:46,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:46,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:35:46,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:35:46,349 INFO L87 Difference]: Start difference. First operand 171 states and 198 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:46,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:46,780 INFO L93 Difference]: Finished difference Result 251 states and 281 transitions. [2022-12-13 13:35:46,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 13:35:46,781 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-13 13:35:46,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:46,782 INFO L225 Difference]: With dead ends: 251 [2022-12-13 13:35:46,782 INFO L226 Difference]: Without dead ends: 251 [2022-12-13 13:35:46,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-12-13 13:35:46,783 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 280 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:46,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 692 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 13:35:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-12-13 13:35:46,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 171. [2022-12-13 13:35:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.3133333333333332) internal successors, (197), 170 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-12-13 13:35:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 197 transitions. [2022-12-13 13:35:46,787 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 197 transitions. Word has length 29 [2022-12-13 13:35:46,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:46,788 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 197 transitions. [2022-12-13 13:35:46,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 197 transitions. [2022-12-13 13:35:46,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 13:35:46,788 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:46,788 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:46,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 13:35:46,788 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:46,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:46,788 INFO L85 PathProgramCache]: Analyzing trace with hash 439757914, now seen corresponding path program 1 times [2022-12-13 13:35:46,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:46,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243152020] [2022-12-13 13:35:46,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:46,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:46,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:46,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243152020] [2022-12-13 13:35:46,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243152020] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:46,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979287306] [2022-12-13 13:35:46,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:46,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:46,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:35:46,959 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:35:46,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:35:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:47,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 13:35:47,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:47,100 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-12-13 13:35:47,105 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-12-13 13:35:47,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:47,137 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-12-13 13:35:47,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:47,145 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-12-13 13:35:47,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:47,179 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-12-13 13:35:47,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:47,186 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-12-13 13:35:47,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:47,202 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-12-13 13:35:47,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:47,210 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-12-13 13:35:47,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:35:47,309 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:35:47,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:35:47,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:47,315 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 15 treesize of output 10 [2022-12-13 13:35:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:47,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:47,805 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 10 treesize of output 8 [2022-12-13 13:35:47,811 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 14 treesize of output 12 [2022-12-13 13:35:47,818 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 10 treesize of output 8 [2022-12-13 13:35:47,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:47,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979287306] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:47,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:47,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-12-13 13:35:47,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266059045] [2022-12-13 13:35:47,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:47,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:35:47,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:47,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:35:47,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:35:47,833 INFO L87 Difference]: Start difference. First operand 171 states and 197 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 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-12-13 13:35:48,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:48,182 INFO L93 Difference]: Finished difference Result 212 states and 241 transitions. [2022-12-13 13:35:48,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:35:48,183 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-13 13:35:48,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:48,184 INFO L225 Difference]: With dead ends: 212 [2022-12-13 13:35:48,184 INFO L226 Difference]: Without dead ends: 212 [2022-12-13 13:35:48,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-12-13 13:35:48,185 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 354 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:48,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 378 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:35:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-12-13 13:35:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 184. [2022-12-13 13:35:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 163 states have (on average 1.3006134969325154) internal successors, (212), 183 states have internal predecessors, (212), 0 states have call successors, (0), 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-12-13 13:35:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 212 transitions. [2022-12-13 13:35:48,189 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 212 transitions. Word has length 29 [2022-12-13 13:35:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:48,189 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 212 transitions. [2022-12-13 13:35:48,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 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-12-13 13:35:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 212 transitions. [2022-12-13 13:35:48,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 13:35:48,189 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:48,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:48,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:35:48,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 13:35:48,390 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:48,391 INFO L85 PathProgramCache]: Analyzing trace with hash -469775188, now seen corresponding path program 1 times [2022-12-13 13:35:48,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:48,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440543837] [2022-12-13 13:35:48,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:48,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:48,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:48,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440543837] [2022-12-13 13:35:48,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440543837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:48,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:48,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:35:48,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072621850] [2022-12-13 13:35:48,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:48,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:35:48,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:48,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:35:48,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:35:48,493 INFO L87 Difference]: Start difference. First operand 184 states and 212 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:48,761 INFO L93 Difference]: Finished difference Result 232 states and 263 transitions. [2022-12-13 13:35:48,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:35:48,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-13 13:35:48,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:48,762 INFO L225 Difference]: With dead ends: 232 [2022-12-13 13:35:48,762 INFO L226 Difference]: Without dead ends: 232 [2022-12-13 13:35:48,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:35:48,763 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 58 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:48,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 507 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:35:48,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-12-13 13:35:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 190. [2022-12-13 13:35:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.2958579881656804) internal successors, (219), 189 states have internal predecessors, (219), 0 states have call successors, (0), 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-12-13 13:35:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 219 transitions. [2022-12-13 13:35:48,767 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 219 transitions. Word has length 31 [2022-12-13 13:35:48,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:48,767 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 219 transitions. [2022-12-13 13:35:48,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 219 transitions. [2022-12-13 13:35:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 13:35:48,768 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:48,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:48,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 13:35:48,768 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:48,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:48,769 INFO L85 PathProgramCache]: Analyzing trace with hash 605010984, now seen corresponding path program 1 times [2022-12-13 13:35:48,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:48,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696606237] [2022-12-13 13:35:48,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:48,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:49,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:49,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696606237] [2022-12-13 13:35:49,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696606237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:49,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:49,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 13:35:49,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196430334] [2022-12-13 13:35:49,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:49,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:35:49,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:49,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:35:49,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:35:49,109 INFO L87 Difference]: Start difference. First operand 190 states and 219 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:49,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:49,632 INFO L93 Difference]: Finished difference Result 228 states and 254 transitions. [2022-12-13 13:35:49,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 13:35:49,632 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-13 13:35:49,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:49,634 INFO L225 Difference]: With dead ends: 228 [2022-12-13 13:35:49,634 INFO L226 Difference]: Without dead ends: 228 [2022-12-13 13:35:49,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2022-12-13 13:35:49,635 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 204 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:49,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 743 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 13:35:49,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-12-13 13:35:49,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 187. [2022-12-13 13:35:49,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 186 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 214 transitions. [2022-12-13 13:35:49,637 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 214 transitions. Word has length 34 [2022-12-13 13:35:49,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:49,637 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 214 transitions. [2022-12-13 13:35:49,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2022-12-13 13:35:49,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 13:35:49,638 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:49,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:49,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 13:35:49,638 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:49,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:49,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1443725027, now seen corresponding path program 1 times [2022-12-13 13:35:49,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:49,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934412985] [2022-12-13 13:35:49,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:49,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:35:49,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:49,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934412985] [2022-12-13 13:35:49,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934412985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:49,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:49,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:35:49,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264761227] [2022-12-13 13:35:49,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:49,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:35:49,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:49,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:35:49,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:35:49,771 INFO L87 Difference]: Start difference. First operand 187 states and 214 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 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-12-13 13:35:49,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:49,923 INFO L93 Difference]: Finished difference Result 234 states and 265 transitions. [2022-12-13 13:35:49,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:35:49,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 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-12-13 13:35:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:49,924 INFO L225 Difference]: With dead ends: 234 [2022-12-13 13:35:49,924 INFO L226 Difference]: Without dead ends: 234 [2022-12-13 13:35:49,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:35:49,924 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 149 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:49,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 335 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:35:49,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-12-13 13:35:49,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 204. [2022-12-13 13:35:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.2677595628415301) internal successors, (232), 203 states have internal predecessors, (232), 0 states have call successors, (0), 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-12-13 13:35:49,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2022-12-13 13:35:49,927 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 36 [2022-12-13 13:35:49,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:49,927 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2022-12-13 13:35:49,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 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-12-13 13:35:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2022-12-13 13:35:49,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 13:35:49,928 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:49,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:49,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 13:35:49,928 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:49,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:49,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1443714042, now seen corresponding path program 1 times [2022-12-13 13:35:49,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:49,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758441005] [2022-12-13 13:35:49,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:49,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:35:49,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:49,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758441005] [2022-12-13 13:35:49,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758441005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:49,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:49,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:35:49,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071911805] [2022-12-13 13:35:49,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:49,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:35:49,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:49,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:35:49,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:35:49,972 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-12-13 13:35:50,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:50,047 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2022-12-13 13:35:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:35:50,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-12-13 13:35:50,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:50,048 INFO L225 Difference]: With dead ends: 221 [2022-12-13 13:35:50,048 INFO L226 Difference]: Without dead ends: 221 [2022-12-13 13:35:50,048 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-12-13 13:35:50,049 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 125 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:50,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 136 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:35:50,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-12-13 13:35:50,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 206. [2022-12-13 13:35:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.2648648648648648) internal successors, (234), 205 states have internal predecessors, (234), 0 states have call successors, (0), 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-12-13 13:35:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 234 transitions. [2022-12-13 13:35:50,052 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 234 transitions. Word has length 36 [2022-12-13 13:35:50,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:50,052 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 234 transitions. [2022-12-13 13:35:50,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 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-12-13 13:35:50,052 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 234 transitions. [2022-12-13 13:35:50,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 13:35:50,053 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:50,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:50,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 13:35:50,053 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:50,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:50,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1805802628, now seen corresponding path program 1 times [2022-12-13 13:35:50,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:50,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771804520] [2022-12-13 13:35:50,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:50,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:50,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:50,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771804520] [2022-12-13 13:35:50,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771804520] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:50,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306452123] [2022-12-13 13:35:50,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:50,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:50,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:35:50,286 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:35:50,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:35:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:50,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 13:35:50,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:50,380 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-12-13 13:35:50,399 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-12-13 13:35:50,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-12-13 13:35:50,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:50,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:52,857 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 20 treesize of output 18 [2022-12-13 13:35:52,861 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 46 treesize of output 42 [2022-12-13 13:35:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:52,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306452123] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:52,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:35:52,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 8] total 22 [2022-12-13 13:35:52,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609704437] [2022-12-13 13:35:52,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:52,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:35:52,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:52,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:35:52,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-12-13 13:35:52,883 INFO L87 Difference]: Start difference. First operand 206 states and 234 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 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-12-13 13:35:53,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:35:53,151 INFO L93 Difference]: Finished difference Result 219 states and 247 transitions. [2022-12-13 13:35:53,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:35:53,152 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-12-13 13:35:53,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:35:53,152 INFO L225 Difference]: With dead ends: 219 [2022-12-13 13:35:53,152 INFO L226 Difference]: Without dead ends: 219 [2022-12-13 13:35:53,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2022-12-13 13:35:53,153 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 243 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:35:53,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 327 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:35:53,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-12-13 13:35:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 204. [2022-12-13 13:35:53,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.2622950819672132) internal successors, (231), 203 states have internal predecessors, (231), 0 states have call successors, (0), 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-12-13 13:35:53,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 231 transitions. [2022-12-13 13:35:53,156 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 231 transitions. Word has length 37 [2022-12-13 13:35:53,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:35:53,156 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 231 transitions. [2022-12-13 13:35:53,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 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-12-13 13:35:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 231 transitions. [2022-12-13 13:35:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-13 13:35:53,157 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:35:53,157 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:53,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 13:35:53,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 13:35:53,359 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:35:53,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:53,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1898858598, now seen corresponding path program 1 times [2022-12-13 13:35:53,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:53,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288806142] [2022-12-13 13:35:53,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:53,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:53,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:53,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288806142] [2022-12-13 13:35:53,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288806142] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:53,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435758562] [2022-12-13 13:35:53,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:53,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:53,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:35:53,891 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:35:53,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:35:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:53,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 13:35:53,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:53,999 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-12-13 13:35:54,018 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-12-13 13:35:54,069 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:35:54,070 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-12-13 13:35:54,113 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 13:35:54,113 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 26 [2022-12-13 13:35:54,227 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:35:54,227 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 43 treesize of output 42 [2022-12-13 13:35:54,426 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:35:54,427 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 73 treesize of output 63 [2022-12-13 13:35:54,529 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:35:54,529 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 73 treesize of output 63 [2022-12-13 13:35:54,564 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:35:54,564 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 73 treesize of output 63 [2022-12-13 13:35:54,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:54,848 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 52 treesize of output 36 [2022-12-13 13:35:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:54,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:55,039 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1039) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2022-12-13 13:35:55,115 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1036 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1036))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1039)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2022-12-13 13:35:55,171 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8| 1))) (or (not (= (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 0)) (= (select .cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_1036))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1039)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)))) is different from false [2022-12-13 13:35:55,191 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8| 1))) (or (not (= (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|) 0)) (= (select .cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_1036))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1039)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)))) is different from false [2022-12-13 13:35:55,210 INFO L321 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-12-13 13:35:55,210 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 2 case distinctions, treesize of input 53 treesize of output 46 [2022-12-13 13:35:55,217 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 13:35:55,217 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 177 treesize of output 117 [2022-12-13 13:35:55,222 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 98 treesize of output 90 [2022-12-13 13:35:55,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:55,230 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 90 treesize of output 88 [2022-12-13 13:35:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-13 13:35:59,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435758562] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:59,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:59,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 34 [2022-12-13 13:35:59,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14040295] [2022-12-13 13:35:59,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:59,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 13:35:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:59,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 13:35:59,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=741, Unknown=47, NotChecked=244, Total=1190 [2022-12-13 13:35:59,337 INFO L87 Difference]: Start difference. First operand 204 states and 231 transitions. Second operand has 35 states, 34 states have (on average 3.088235294117647) internal successors, (105), 35 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:36:07,536 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_1039 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1)) is different from false [2022-12-13 13:36:09,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:36:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:36:18,671 INFO L93 Difference]: Finished difference Result 598 states and 674 transitions. [2022-12-13 13:36:18,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-13 13:36:18,672 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.088235294117647) internal successors, (105), 35 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-12-13 13:36:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:36:18,673 INFO L225 Difference]: With dead ends: 598 [2022-12-13 13:36:18,673 INFO L226 Difference]: Without dead ends: 598 [2022-12-13 13:36:18,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=696, Invalid=3143, Unknown=87, NotChecked=630, Total=4556 [2022-12-13 13:36:18,674 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 597 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 1916 mSolverCounterSat, 93 mSolverCounterUnsat, 64 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 3373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1916 IncrementalHoareTripleChecker+Invalid, 64 IncrementalHoareTripleChecker+Unknown, 1300 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:36:18,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 1824 Invalid, 3373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1916 Invalid, 64 Unknown, 1300 Unchecked, 3.5s Time] [2022-12-13 13:36:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-12-13 13:36:18,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 249. [2022-12-13 13:36:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 228 states have (on average 1.25) internal successors, (285), 248 states have internal predecessors, (285), 0 states have call successors, (0), 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-12-13 13:36:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 285 transitions. [2022-12-13 13:36:18,678 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 285 transitions. Word has length 38 [2022-12-13 13:36:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:36:18,678 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 285 transitions. [2022-12-13 13:36:18,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.088235294117647) internal successors, (105), 35 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:36:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 285 transitions. [2022-12-13 13:36:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-13 13:36:18,678 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:36:18,678 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:18,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 13:36:18,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 13:36:18,880 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:36:18,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1898858599, now seen corresponding path program 1 times [2022-12-13 13:36:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:18,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477853068] [2022-12-13 13:36:18,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:18,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:19,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:19,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477853068] [2022-12-13 13:36:19,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477853068] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:19,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653131307] [2022-12-13 13:36:19,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:19,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:19,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:36:19,324 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:36:19,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 13:36:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:19,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-13 13:36:19,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:19,428 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-12-13 13:36:19,453 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-12-13 13:36:19,460 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-12-13 13:36:19,551 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:36:19,551 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-12-13 13:36:19,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:36:19,601 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-12-13 13:36:19,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:36:19,606 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-12-13 13:36:19,694 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:36:19,694 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 38 treesize of output 37 [2022-12-13 13:36:19,700 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 20 treesize of output 22 [2022-12-13 13:36:19,826 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 13:36:19,827 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 16 treesize of output 22 [2022-12-13 13:36:19,831 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-12-13 13:36:19,844 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:36:19,844 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 29 [2022-12-13 13:36:19,949 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 13:36:19,949 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 16 treesize of output 22 [2022-12-13 13:36:19,954 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-12-13 13:36:19,968 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:36:19,968 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 29 [2022-12-13 13:36:20,027 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:36:20,028 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-12-13 13:36:20,034 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 20 treesize of output 22 [2022-12-13 13:36:20,215 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 19 treesize of output 7 [2022-12-13 13:36:20,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:36:20,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:20,222 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 27 treesize of output 11 [2022-12-13 13:36:20,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:20,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:20,388 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1171 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1172 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2022-12-13 13:36:20,418 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1172 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1171 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1171) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2022-12-13 13:36:20,426 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1172 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1171 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1171) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2022-12-13 13:36:20,441 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1165))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1171)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1166) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1165) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-12-13 13:36:20,451 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1165))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1171)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1166) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1165) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) is different from false [2022-12-13 13:36:20,474 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|))) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1165))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1171)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1164 Int) (v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= (select (select (store (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_1164)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1166) (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1165) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-12-13 13:36:26,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:36:26,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:26,737 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 2 case distinctions, treesize of input 48 treesize of output 41 [2022-12-13 13:36:26,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:36:26,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:26,745 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 242 treesize of output 164 [2022-12-13 13:36:26,751 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 133 treesize of output 117 [2022-12-13 13:36:26,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:36:26,756 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 0 case distinctions, treesize of input 117 treesize of output 97 [2022-12-13 13:36:26,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:36:26,776 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-13 13:36:26,776 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 2 case distinctions, treesize of input 48 treesize of output 1 [2022-12-13 13:36:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:26,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653131307] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:26,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:26,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 38 [2022-12-13 13:36:26,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289261779] [2022-12-13 13:36:26,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:26,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 13:36:26,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:26,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 13:36:26,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=888, Unknown=10, NotChecked=390, Total=1406 [2022-12-13 13:36:26,821 INFO L87 Difference]: Start difference. First operand 249 states and 285 transitions. Second operand has 38 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 38 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:36:28,974 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 [0] [2022-12-13 13:36:31,024 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 [0] [2022-12-13 13:36:33,148 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 [0] [2022-12-13 13:36:35,266 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 [0] [2022-12-13 13:36:57,990 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) |c_ULTIMATE.start_main_~x~0#1.offset|) (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1165))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1171)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1166) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1165) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 1) (= (select .cse4 .cse0) |c_ULTIMATE.start_main_~x~0#1.base|)))) is different from false [2022-12-13 13:36:58,019 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1165))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1171)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_1166 (Array Int Int)) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1166) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1165) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1172) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) is different from false [2022-12-13 13:37:03,714 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 [0] [2022-12-13 13:37:05,907 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 [0] [2022-12-13 13:37:12,248 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 [0] [2022-12-13 13:37:12,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:12,248 INFO L93 Difference]: Finished difference Result 887 states and 992 transitions. [2022-12-13 13:37:12,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-12-13 13:37:12,249 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 38 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-12-13 13:37:12,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:12,251 INFO L225 Difference]: With dead ends: 887 [2022-12-13 13:37:12,251 INFO L226 Difference]: Without dead ends: 887 [2022-12-13 13:37:12,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 124 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 4585 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=1746, Invalid=12050, Unknown=42, NotChecked=1912, Total=15750 [2022-12-13 13:37:12,253 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 1530 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 2922 mSolverCounterSat, 169 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 5355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2922 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 2228 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:12,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 2092 Invalid, 5355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2922 Invalid, 36 Unknown, 2228 Unchecked, 21.5s Time] [2022-12-13 13:37:12,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-12-13 13:37:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 303. [2022-12-13 13:37:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 282 states have (on average 1.2304964539007093) internal successors, (347), 302 states have internal predecessors, (347), 0 states have call successors, (0), 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-12-13 13:37:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 347 transitions. [2022-12-13 13:37:12,257 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 347 transitions. Word has length 38 [2022-12-13 13:37:12,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:12,257 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 347 transitions. [2022-12-13 13:37:12,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 38 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:37:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 347 transitions. [2022-12-13 13:37:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 13:37:12,258 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:12,258 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:12,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 13:37:12,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:12,459 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:37:12,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash 117734209, now seen corresponding path program 1 times [2022-12-13 13:37:12,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:12,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757861574] [2022-12-13 13:37:12,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:12,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:37:12,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:12,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757861574] [2022-12-13 13:37:12,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757861574] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:12,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583667161] [2022-12-13 13:37:12,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:12,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:12,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:37:12,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:37:12,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 13:37:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:12,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 13:37:12,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:13,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:37:13,503 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:37:13,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:37:13,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:13,513 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 15 treesize of output 10 [2022-12-13 13:37:13,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:37:13,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:37:14,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:14,071 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 45 [2022-12-13 13:37:14,093 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:14,094 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 38 treesize of output 41 [2022-12-13 13:37:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:37:14,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583667161] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:37:14,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:37:14,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2022-12-13 13:37:14,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102207784] [2022-12-13 13:37:14,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:37:14,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-13 13:37:14,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:14,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 13:37:14,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-12-13 13:37:14,680 INFO L87 Difference]: Start difference. First operand 303 states and 347 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 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-12-13 13:37:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:17,302 INFO L93 Difference]: Finished difference Result 383 states and 426 transitions. [2022-12-13 13:37:17,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 13:37:17,303 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 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-12-13 13:37:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:17,304 INFO L225 Difference]: With dead ends: 383 [2022-12-13 13:37:17,304 INFO L226 Difference]: Without dead ends: 383 [2022-12-13 13:37:17,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2022-12-13 13:37:17,305 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 566 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 68 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:17,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 893 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 893 Invalid, 8 Unknown, 0 Unchecked, 1.9s Time] [2022-12-13 13:37:17,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-12-13 13:37:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 322. [2022-12-13 13:37:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 301 states have (on average 1.2358803986710964) internal successors, (372), 321 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:37:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 372 transitions. [2022-12-13 13:37:17,309 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 372 transitions. Word has length 39 [2022-12-13 13:37:17,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:17,309 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 372 transitions. [2022-12-13 13:37:17,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 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-12-13 13:37:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 372 transitions. [2022-12-13 13:37:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 13:37:17,309 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:17,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:17,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 13:37:17,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-13 13:37:17,511 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:37:17,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:17,512 INFO L85 PathProgramCache]: Analyzing trace with hash -645207573, now seen corresponding path program 1 times [2022-12-13 13:37:17,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:17,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034858211] [2022-12-13 13:37:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:17,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:37:17,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:17,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034858211] [2022-12-13 13:37:17,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034858211] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:17,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741972802] [2022-12-13 13:37:17,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:17,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:17,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:37:17,637 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:37:17,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 13:37:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:17,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 13:37:17,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:17,877 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-12-13 13:37:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:37:17,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:37:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:37:18,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741972802] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:37:18,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:37:18,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-12-13 13:37:18,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008043700] [2022-12-13 13:37:18,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:37:18,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:37:18,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:18,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:37:18,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:37:18,050 INFO L87 Difference]: Start difference. First operand 322 states and 372 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:37:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:18,468 INFO L93 Difference]: Finished difference Result 328 states and 377 transitions. [2022-12-13 13:37:18,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:37:18,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-12-13 13:37:18,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:18,471 INFO L225 Difference]: With dead ends: 328 [2022-12-13 13:37:18,471 INFO L226 Difference]: Without dead ends: 293 [2022-12-13 13:37:18,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:18,471 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 31 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:18,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 238 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 13:37:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-12-13 13:37:18,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2022-12-13 13:37:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 272 states have (on average 1.25) internal successors, (340), 292 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:37:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 340 transitions. [2022-12-13 13:37:18,475 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 340 transitions. Word has length 40 [2022-12-13 13:37:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:18,475 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 340 transitions. [2022-12-13 13:37:18,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:37:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 340 transitions. [2022-12-13 13:37:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 13:37:18,476 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:18,476 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:18,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 13:37:18,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:18,678 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:37:18,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:18,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1766771785, now seen corresponding path program 1 times [2022-12-13 13:37:18,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:18,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262134106] [2022-12-13 13:37:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:18,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:37:20,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:20,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262134106] [2022-12-13 13:37:20,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262134106] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:20,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515458976] [2022-12-13 13:37:20,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:20,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:20,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:37:20,249 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:37:20,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 13:37:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:20,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 13:37:20,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:20,369 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-12-13 13:37:20,475 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-12-13 13:37:20,488 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-12-13 13:37:20,728 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:37:20,728 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-12-13 13:37:20,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:37:20,837 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-12-13 13:37:20,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:37:20,867 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-12-13 13:37:21,090 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:37:21,090 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-12-13 13:37:21,097 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 34 treesize of output 32 [2022-12-13 13:37:21,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:37:21,406 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 30 treesize of output 28 [2022-12-13 13:37:21,430 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:37:21,430 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 29 [2022-12-13 13:37:21,594 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:37:21,594 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 29 [2022-12-13 13:37:21,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:37:21,608 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 30 treesize of output 28 [2022-12-13 13:37:21,671 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:37:21,672 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-12-13 13:37:21,683 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 34 treesize of output 32 [2022-12-13 13:37:22,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:37:22,208 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 27 treesize of output 11 [2022-12-13 13:37:22,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:37:22,219 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 33 treesize of output 13 [2022-12-13 13:37:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:37:22,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:37:22,506 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1414 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1415 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1415) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2022-12-13 13:37:22,803 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1415 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1415) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1414 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1414) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) is different from false [2022-12-13 13:37:22,834 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1409 (Array Int Int)) (v_ArrVal_1408 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1408) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1409) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1415) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1409))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1414)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2022-12-13 13:37:22,860 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1409))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1414)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1409 (Array Int Int)) (v_ArrVal_1408 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1408) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1409) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1415) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-12-13 13:37:25,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:37:25,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:25,612 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 2 case distinctions, treesize of input 48 treesize of output 54 [2022-12-13 13:37:25,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:37:25,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:25,633 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 2 case distinctions, treesize of input 35 treesize of output 41 [2022-12-13 13:37:25,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:37:25,642 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 75 treesize of output 49 [2022-12-13 13:37:25,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:37:25,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:25,653 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 196 treesize of output 168 [2022-12-13 13:37:25,667 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 70 treesize of output 58 [2022-12-13 13:37:25,673 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 29 treesize of output 21 [2022-12-13 13:37:25,679 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 28 treesize of output 20 [2022-12-13 13:37:25,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:37:25,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:37:25,696 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-13 13:37:25,696 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2022-12-13 13:37:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:37:25,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515458976] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:37:25,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:37:25,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 15] total 38 [2022-12-13 13:37:25,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744585275] [2022-12-13 13:37:25,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:37:25,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 13:37:25,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:25,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 13:37:25,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=930, Unknown=37, NotChecked=268, Total=1406 [2022-12-13 13:37:25,791 INFO L87 Difference]: Start difference. First operand 293 states and 340 transitions. Second operand has 38 states, 38 states have (on average 2.9473684210526314) internal successors, (112), 38 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-12-13 13:37:33,379 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse1 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~head~0#1.offset|))) (and (or .cse0 .cse1) (or .cse1 .cse2) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) .cse0 (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int)) (or (forall ((v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_16| v_ArrVal_1409))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1414)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 0)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int)) (or (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1409 (Array Int Int)) (v_ArrVal_1408 (Array Int Int))) (= (select (select (store (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| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_16| v_ArrVal_1408) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_16| v_ArrVal_1409) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1415) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 0)))) .cse2 (forall ((v_ArrVal_1415 (Array Int Int)) (v_ArrVal_1409 (Array Int Int)) (v_ArrVal_1408 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1408) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1409) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1415) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5))) (forall ((v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1409 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1409))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1414)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse5) |c_ULTIMATE.start_main_~head~0#1.base|))))) is different from false [2022-12-13 13:37:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:41,152 INFO L93 Difference]: Finished difference Result 652 states and 744 transitions. [2022-12-13 13:37:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-13 13:37:41,153 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.9473684210526314) internal successors, (112), 38 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 40 [2022-12-13 13:37:41,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:41,154 INFO L225 Difference]: With dead ends: 652 [2022-12-13 13:37:41,154 INFO L226 Difference]: Without dead ends: 652 [2022-12-13 13:37:41,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=843, Invalid=3686, Unknown=47, NotChecked=680, Total=5256 [2022-12-13 13:37:41,156 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 939 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 117 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 2689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 1131 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:41,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 1338 Invalid, 2689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1428 Invalid, 13 Unknown, 1131 Unchecked, 3.9s Time] [2022-12-13 13:37:41,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-12-13 13:37:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 309. [2022-12-13 13:37:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 288 states have (on average 1.2534722222222223) internal successors, (361), 308 states have internal predecessors, (361), 0 states have call successors, (0), 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-12-13 13:37:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 361 transitions. [2022-12-13 13:37:41,160 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 361 transitions. Word has length 40 [2022-12-13 13:37:41,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:41,160 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 361 transitions. [2022-12-13 13:37:41,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.9473684210526314) internal successors, (112), 38 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-12-13 13:37:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 361 transitions. [2022-12-13 13:37:41,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 13:37:41,161 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:41,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:41,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 13:37:41,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:41,362 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:37:41,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:41,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1739978080, now seen corresponding path program 1 times [2022-12-13 13:37:41,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:41,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926172243] [2022-12-13 13:37:41,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:41,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:37:41,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:41,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926172243] [2022-12-13 13:37:41,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926172243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:41,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:41,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 13:37:41,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767026727] [2022-12-13 13:37:41,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:41,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:37:41,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:41,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:37:41,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:37:41,696 INFO L87 Difference]: Start difference. First operand 309 states and 361 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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-12-13 13:37:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:42,780 INFO L93 Difference]: Finished difference Result 338 states and 389 transitions. [2022-12-13 13:37:42,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:37:42,781 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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 42 [2022-12-13 13:37:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:42,782 INFO L225 Difference]: With dead ends: 338 [2022-12-13 13:37:42,782 INFO L226 Difference]: Without dead ends: 333 [2022-12-13 13:37:42,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2022-12-13 13:37:42,783 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 196 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:42,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 381 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 13:37:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-12-13 13:37:42,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 305. [2022-12-13 13:37:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 284 states have (on average 1.2535211267605635) internal successors, (356), 304 states have internal predecessors, (356), 0 states have call successors, (0), 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-12-13 13:37:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 356 transitions. [2022-12-13 13:37:42,786 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 356 transitions. Word has length 42 [2022-12-13 13:37:42,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:42,786 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 356 transitions. [2022-12-13 13:37:42,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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-12-13 13:37:42,786 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 356 transitions. [2022-12-13 13:37:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 13:37:42,787 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:42,787 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:42,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 13:37:42,787 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:37:42,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:42,787 INFO L85 PathProgramCache]: Analyzing trace with hash 25746790, now seen corresponding path program 1 times [2022-12-13 13:37:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:42,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694020444] [2022-12-13 13:37:42,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:42,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:37:43,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:43,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694020444] [2022-12-13 13:37:43,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694020444] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:43,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567132900] [2022-12-13 13:37:43,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:43,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:43,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:37:43,751 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:37:43,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 13:37:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:43,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 13:37:43,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:43,869 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-12-13 13:37:43,955 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:37:43,955 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-12-13 13:37:44,038 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 13 treesize of output 9 [2022-12-13 13:37:44,137 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:37:44,137 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 34 treesize of output 35 [2022-12-13 13:37:44,374 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-12-13 13:37:44,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-12-13 13:37:44,529 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 13:37:44,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 1 case distinctions, treesize of input 43 treesize of output 36 [2022-12-13 13:37:45,006 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:37:45,006 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 88 treesize of output 79 [2022-12-13 13:37:45,677 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:37:45,677 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 118 treesize of output 100 [2022-12-13 13:37:45,996 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:37:45,996 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 118 treesize of output 100 [2022-12-13 13:37:46,098 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:37:46,098 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 118 treesize of output 100 [2022-12-13 13:37:46,738 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 33 treesize of output 17 [2022-12-13 13:37:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:37:46,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:37:47,207 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1593 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1593) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2022-12-13 13:37:47,231 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1593 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1590))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1593)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2022-12-13 13:37:47,247 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1593 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1590))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1593)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2022-12-13 13:37:47,270 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1593 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1590))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1593)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2022-12-13 13:37:47,294 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1593 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_19| Int) (v_ArrVal_1590 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_19| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_19|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_19| v_ArrVal_1590))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1593)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_19|) 0)))) is different from false [2022-12-13 13:37:47,327 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1593 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_19| Int) (v_ArrVal_1590 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_19| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_19|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_19| v_ArrVal_1590))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1593)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_19|) 0)))) is different from false [2022-12-13 13:37:47,358 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1593 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_19| Int) (v_ArrVal_1590 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_19|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_19| 1) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1586))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_19|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_19| v_ArrVal_1590))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1593)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2022-12-13 13:37:47,496 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:37:47,496 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 95 treesize of output 66 [2022-12-13 13:37:47,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:37:47,504 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 96 treesize of output 92 [2022-12-13 13:37:47,516 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 51 treesize of output 47 [2022-12-13 13:37:47,524 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 83 treesize of output 75 [2022-12-13 13:37:47,535 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 57 treesize of output 49 [2022-12-13 13:37:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-13 13:37:47,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567132900] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:37:47,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:37:47,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 38 [2022-12-13 13:37:47,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210989613] [2022-12-13 13:37:47,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:37:47,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 13:37:47,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:47,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 13:37:47,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=824, Unknown=20, NotChecked=462, Total=1482 [2022-12-13 13:37:47,899 INFO L87 Difference]: Start difference. First operand 305 states and 356 transitions. Second operand has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:37:51,389 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= (select |c_#valid| (select .cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) 1) (not (= .cse1 |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc7#1.base|) 1) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |c_#valid| .cse1) 1) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1593 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1590))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1593)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) 1)) (not (= .cse1 |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~x~0#1.offset| .cse3)) (= (select |c_#valid| (select .cse0 .cse3)) 1)))) is different from false [2022-12-13 13:38:00,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:38:00,797 INFO L93 Difference]: Finished difference Result 573 states and 657 transitions. [2022-12-13 13:38:00,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 13:38:00,798 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-12-13 13:38:00,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:38:00,799 INFO L225 Difference]: With dead ends: 573 [2022-12-13 13:38:00,799 INFO L226 Difference]: Without dead ends: 573 [2022-12-13 13:38:00,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=620, Invalid=2930, Unknown=22, NotChecked=984, Total=4556 [2022-12-13 13:38:00,801 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 607 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 2033 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 3828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1692 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:38:00,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1559 Invalid, 3828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2033 Invalid, 0 Unknown, 1692 Unchecked, 6.5s Time] [2022-12-13 13:38:00,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-12-13 13:38:00,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 318. [2022-12-13 13:38:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 297 states have (on average 1.2491582491582491) internal successors, (371), 317 states have internal predecessors, (371), 0 states have call successors, (0), 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-12-13 13:38:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 371 transitions. [2022-12-13 13:38:00,805 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 371 transitions. Word has length 42 [2022-12-13 13:38:00,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:38:00,805 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 371 transitions. [2022-12-13 13:38:00,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:38:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 371 transitions. [2022-12-13 13:38:00,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 13:38:00,806 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:38:00,806 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:00,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 13:38:01,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 13:38:01,008 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:38:01,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:01,009 INFO L85 PathProgramCache]: Analyzing trace with hash 25746791, now seen corresponding path program 1 times [2022-12-13 13:38:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:01,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804769405] [2022-12-13 13:38:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:01,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:03,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:03,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804769405] [2022-12-13 13:38:03,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804769405] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:03,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464375390] [2022-12-13 13:38:03,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:03,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:03,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:38:03,861 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:38:03,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 13:38:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:03,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-13 13:38:03,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:03,994 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-12-13 13:38:04,237 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:38:04,237 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-12-13 13:38:04,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:38:04,429 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-12-13 13:38:04,444 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 13 treesize of output 9 [2022-12-13 13:38:04,863 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:38:04,864 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 57 treesize of output 54 [2022-12-13 13:38:04,891 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 22 treesize of output 24 [2022-12-13 13:38:05,225 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-12-13 13:38:05,226 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 1 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 13:38:05,319 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-12-13 13:38:05,320 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 22 treesize of output 24 [2022-12-13 13:38:05,587 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 13:38:05,588 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 21 treesize of output 20 [2022-12-13 13:38:05,664 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 13:38:05,664 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 43 treesize of output 36 [2022-12-13 13:38:06,492 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:38:06,492 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 98 treesize of output 87 [2022-12-13 13:38:06,514 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-12-13 13:38:07,653 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:38:07,653 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 125 treesize of output 107 [2022-12-13 13:38:07,692 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:38:07,692 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 134 treesize of output 134 [2022-12-13 13:38:08,185 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:38:08,186 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 125 treesize of output 107 [2022-12-13 13:38:08,228 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:38:08,229 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 134 treesize of output 134 [2022-12-13 13:38:08,392 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:38:08,392 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 125 treesize of output 107 [2022-12-13 13:38:08,433 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:38:08,433 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 134 treesize of output 134 [2022-12-13 13:38:09,501 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-12-13 13:38:09,509 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 33 treesize of output 17 [2022-12-13 13:38:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:09,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:38:10,306 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2022-12-13 13:38:10,402 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2022-12-13 13:38:10,430 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) is different from false [2022-12-13 13:38:10,471 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1740) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1741) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1741))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1740) .cse1 v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))))) is different from false [2022-12-13 13:38:10,499 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1741))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1740) .cse1 v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1740) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1741) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) is different from false [2022-12-13 13:38:10,545 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1741))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1740) .cse1 v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1747 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1740) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1741) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))))) is different from false [2022-12-13 13:38:20,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:38:20,590 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 90 treesize of output 81 [2022-12-13 13:38:20,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:38:20,609 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 70 treesize of output 61 [2022-12-13 13:38:20,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:38:20,626 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 160 treesize of output 156 [2022-12-13 13:38:20,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:38:20,637 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 126 treesize of output 120 [2022-12-13 13:38:20,655 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 67 treesize of output 63 [2022-12-13 13:38:20,673 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 77 treesize of output 69 [2022-12-13 13:38:20,684 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 114 treesize of output 106 [2022-12-13 13:38:20,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:38:20,775 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 184 treesize of output 175 [2022-12-13 13:38:20,798 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:38:20,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 115 [2022-12-13 13:38:20,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:38:20,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 376 treesize of output 372 [2022-12-13 13:38:20,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:38:20,831 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 320 treesize of output 310 [2022-12-13 13:38:20,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 388 treesize of output 368 [2022-12-13 13:38:20,858 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 442 treesize of output 426 [2022-12-13 13:38:20,872 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 426 treesize of output 394 [2022-12-13 13:38:20,901 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 264 treesize of output 244 [2022-12-13 13:38:20,929 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 254 treesize of output 238 [2022-12-13 13:38:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:24,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464375390] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:38:24,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:38:24,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 45 [2022-12-13 13:38:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627513310] [2022-12-13 13:38:24,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:38:24,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-13 13:38:24,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:24,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-13 13:38:24,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1384, Unknown=14, NotChecked=486, Total=2070 [2022-12-13 13:38:24,411 INFO L87 Difference]: Start difference. First operand 318 states and 371 transitions. Second operand has 46 states, 45 states have (on average 2.7555555555555555) internal successors, (124), 46 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-12-13 13:38:29,978 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) (.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse8 (select |c_#length| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse7 (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse10 (select .cse4 .cse2))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1741))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1740) .cse1 v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (<= 16 (select |c_#length| .cse5)) (forall ((v_ArrVal_1747 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1740) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1741) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |c_#valid| .cse5) 1) (= (select .cse0 .cse6) |c_ULTIMATE.start_main_~x~0#1.offset|) (= (select .cse0 .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse7 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (<= .cse8 16) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse9 |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (<= 16 (select |c_#length| (select .cse4 .cse6))) (not (<= (+ |c_ULTIMATE.start_main_~head~0#1.offset| 1) |c_ULTIMATE.start_main_~x~0#1.offset|)) (= (select .cse9 .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|) (<= 16 .cse8) (<= 16 (select |c_#length| .cse10)) (= |c_ULTIMATE.start_main_#t~malloc7#1.offset| .cse7) (= (select |c_#valid| .cse10) 1)))) is different from false [2022-12-13 13:38:33,777 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse13 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) (.cse11 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (let ((.cse7 (select |c_#length| .cse5)) (.cse9 (select .cse11 .cse2)) (.cse10 (select |c_#length| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse6 (select .cse4 .cse13)) (.cse8 (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse12 (select .cse4 .cse2))) (and (forall ((v_ArrVal_1747 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1746 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1741))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1740) .cse1 v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1746) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))) (not (= .cse5 |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= .cse6 |c_ULTIMATE.start_main_~x~0#1.base|)) (<= 16 .cse7) (forall ((v_ArrVal_1747 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (<= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1740) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1741) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1747) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |c_#valid| .cse5) 1) (not (= .cse5 |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= (select .cse0 .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|) (= .cse8 0) (= 16 .cse7) (= (select |c_#length| .cse6) 16) (= |c_ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= .cse9 0) (<= .cse10 16) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#length| |c_ULTIMATE.start_main_#t~malloc7#1.base|) 16) (= (select .cse11 |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (not (<= (+ |c_ULTIMATE.start_main_~head~0#1.offset| 1) |c_ULTIMATE.start_main_~x~0#1.offset|)) (= .cse9 |c_ULTIMATE.start_main_~head~0#1.offset|) (<= 16 .cse10) (exists ((v_arrayElimCell_108 Int)) (and (not (= .cse6 v_arrayElimCell_108)) (= 16 (select |c_#length| v_arrayElimCell_108)) (not (= v_arrayElimCell_108 |c_ULTIMATE.start_main_~x~0#1.base|)))) (<= 16 (select |c_#length| .cse12)) (= (select .cse0 .cse13) 0) (= |c_ULTIMATE.start_main_#t~malloc7#1.offset| .cse8) (= (select |c_#valid| .cse12) 1))))) is different from false [2022-12-13 13:39:18,260 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-12-13 13:39:20,327 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-12-13 13:39:22,616 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-12-13 13:39:24,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:39:31,280 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 [0, 1] [2022-12-13 13:39:34,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 13:39:36,898 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 [0, 1] [2022-12-13 13:39:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:39:48,575 INFO L93 Difference]: Finished difference Result 824 states and 943 transitions. [2022-12-13 13:39:48,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-12-13 13:39:48,575 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.7555555555555555) internal successors, (124), 46 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) Word has length 42 [2022-12-13 13:39:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:39:48,577 INFO L225 Difference]: With dead ends: 824 [2022-12-13 13:39:48,577 INFO L226 Difference]: Without dead ends: 824 [2022-12-13 13:39:48,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 2398 ImplicationChecksByTransitivity, 63.1s TimeCoverageRelationStatistics Valid=1027, Invalid=7659, Unknown=88, NotChecked=1528, Total=10302 [2022-12-13 13:39:48,580 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 1540 mSDsluCounter, 2783 mSDsCounter, 0 mSdLazyCounter, 3550 mSolverCounterSat, 166 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 2911 SdHoareTripleChecker+Invalid, 5324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 3550 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 1592 IncrementalHoareTripleChecker+Unchecked, 38.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:39:48,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 2911 Invalid, 5324 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [166 Valid, 3550 Invalid, 16 Unknown, 1592 Unchecked, 38.5s Time] [2022-12-13 13:39:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2022-12-13 13:39:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 359. [2022-12-13 13:39:48,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 338 states have (on average 1.242603550295858) internal successors, (420), 358 states have internal predecessors, (420), 0 states have call successors, (0), 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-12-13 13:39:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 420 transitions. [2022-12-13 13:39:48,586 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 420 transitions. Word has length 42 [2022-12-13 13:39:48,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:39:48,586 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 420 transitions. [2022-12-13 13:39:48,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.7555555555555555) internal successors, (124), 46 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-12-13 13:39:48,586 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 420 transitions. [2022-12-13 13:39:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 13:39:48,586 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:39:48,586 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:39:48,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 13:39:48,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:48,788 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:39:48,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:39:48,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1117398886, now seen corresponding path program 1 times [2022-12-13 13:39:48,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:39:48,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053923812] [2022-12-13 13:39:48,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:48,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:39:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:39:51,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:39:51,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053923812] [2022-12-13 13:39:51,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053923812] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:39:51,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976164157] [2022-12-13 13:39:51,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:39:51,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:39:51,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:39:51,471 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:39:51,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 13:39:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:39:51,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-13 13:39:51,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:39:51,610 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-12-13 13:39:51,731 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-12-13 13:39:51,774 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-12-13 13:39:52,336 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:39:52,337 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-12-13 13:39:52,679 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 13:39:52,680 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 26 [2022-12-13 13:39:52,784 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-13 13:39:52,784 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-12-13 13:39:53,632 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:39:53,632 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 44 treesize of output 43 [2022-12-13 13:39:53,674 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-12-13 13:39:54,837 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:39:54,838 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 60 treesize of output 54 [2022-12-13 13:39:54,895 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:39:54,895 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 69 treesize of output 69 [2022-12-13 13:39:55,249 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:39:55,250 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 60 treesize of output 54 [2022-12-13 13:39:55,306 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:39:55,307 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 69 treesize of output 69 [2022-12-13 13:39:55,530 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:39:55,530 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-12-13 13:39:55,973 INFO L321 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-12-13 13:39:55,974 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 67 treesize of output 53 [2022-12-13 13:39:56,034 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:39:56,034 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 69 treesize of output 69 [2022-12-13 13:39:57,253 INFO L321 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2022-12-13 13:39:57,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 126 [2022-12-13 13:39:57,321 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:39:57,321 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 103 treesize of output 103 [2022-12-13 13:39:58,050 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-12-13 13:39:58,349 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-12-13 13:39:58,386 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-12-13 13:40:07,111 WARN L233 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 79 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:40:08,176 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:08,176 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 82 treesize of output 76 [2022-12-13 13:40:09,989 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-12-13 13:40:10,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:10,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:40:11,999 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (or (forall ((v_ArrVal_1898 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)) 1)) (forall ((v_ArrVal_1899 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1899) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1898 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (or (= .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select |c_#valid| .cse1) 1)))))) is different from false [2022-12-13 13:40:12,053 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1898 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1898) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select |c_#valid| .cse0) 1) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)))) (or (forall ((v_ArrVal_1899 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1899) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (forall ((v_ArrVal_1898 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1898) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) 1))))) is different from false [2022-12-13 13:40:12,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:12,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 95 treesize of output 151 [2022-12-13 13:40:12,862 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse5 (forall ((v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1895 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1895) |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1899) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))) (and (or (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1898 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_prenex_16) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse1 .cse0) (= .cse1 |c_ULTIMATE.start_main_~x~0#1.base|))))) .cse5) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_prenex_16 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)))) (or (= (select (select (store .cse6 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_prenex_16) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_1898 (Array Int Int))) (let ((.cse7 (select (select (store .cse6 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) (= .cse7 |c_ULTIMATE.start_main_~x~0#1.base|))))))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_prenex_16 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)))) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_prenex_16) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1898 (Array Int Int))) (let ((.cse8 (select (select (store .cse10 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) (= .cse8 .cse9) (= .cse8 |c_ULTIMATE.start_main_~x~0#1.base|)))) (= .cse9 |c_ULTIMATE.start_main_~x~0#1.base|))))) (or (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1898 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)))) (or (= (select (select (store .cse11 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_prenex_16) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse11 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse5) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1898 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse12 |c_ULTIMATE.start_main_~head~0#1.base|) (= .cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_prenex_16) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= .cse12 |c_ULTIMATE.start_main_~x~0#1.base|))))) (or (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1898 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_prenex_16) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse14 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store .cse15 |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) .cse14))))) .cse5)))) is different from false [2022-12-13 13:40:15,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:15,067 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 1 case distinctions, treesize of input 61 treesize of output 54 [2022-12-13 13:40:15,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:15,123 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 1 case distinctions, treesize of input 58 treesize of output 51 [2022-12-13 13:40:15,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:15,192 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 1 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 13:40:19,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:19,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 360 treesize of output 386 [2022-12-13 13:40:19,160 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 29 treesize of output 21 [2022-12-13 13:40:19,296 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-12-13 13:40:19,533 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 19 treesize of output 11 [2022-12-13 13:40:19,632 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-12-13 13:40:19,647 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1898 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1895 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1890 (Array Int Int)) (v_prenex_16 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1889))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse0 (store .cse5 .cse3 v_arrayElimArr_14)) (.cse1 (select v_arrayElimArr_14 (+ 8 v_subst_3)))) (or (= (select (select (store .cse0 .cse1 v_ArrVal_1898) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) .cse3) (= .cse3 (select (select (store .cse0 .cse1 v_prenex_16) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1890) .cse3 v_ArrVal_1895) .cse1 v_ArrVal_1899) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1899 (Array Int Int)) (v_ArrVal_1898 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1895 (Array Int Int)) (v_ArrVal_1890 (Array Int Int)) (v_subst_3 Int) (v_prenex_16 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1889))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse7 (store .cse10 .cse9 v_arrayElimArr_14)) (.cse8 (select v_arrayElimArr_14 (+ 8 v_subst_3)))) (or (= (select (select (store .cse7 .cse8 v_ArrVal_1898) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) .cse9) (= .cse9 (select (select (store .cse7 .cse8 v_prenex_16) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (= .cse8 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse4 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1890) .cse9 v_ArrVal_1895) .cse8 v_ArrVal_1899) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_subst_4 Int)) (let ((.cse11 (select v_arrayElimArr_12 (+ 8 v_subst_4)))) (or (= .cse11 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_prenex_43 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse6 |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_prenex_43))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse13 (store .cse15 .cse14 v_arrayElimArr_12))) (let ((.cse12 (select (select (store .cse13 .cse11 v_prenex_44) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse12 |c_ULTIMATE.start_main_~head~0#1.base|) (= (select (select (store .cse13 .cse11 v_prenex_45) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) .cse14) (= .cse14 .cse12)))))))))))) is different from false [2022-12-13 13:40:23,146 INFO L321 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2022-12-13 13:40:23,146 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 2 case distinctions, treesize of input 55 treesize of output 68 [2022-12-13 13:40:23,272 INFO L321 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-12-13 13:40:23,272 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 2 case distinctions, treesize of input 118 treesize of output 84 [2022-12-13 13:40:23,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:40:23,334 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 13:40:23,335 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 232 treesize of output 166 [2022-12-13 13:40:23,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:40:23,402 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:23,402 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 53 treesize of output 53 [2022-12-13 13:40:23,457 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:23,457 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 59 treesize of output 53 [2022-12-13 13:40:23,476 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-12-13 13:40:23,516 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:40:23,517 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 19 treesize of output 19 [2022-12-13 13:40:23,533 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 12 treesize of output 8 [2022-12-13 13:40:23,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:40:23,613 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-13 13:40:23,614 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 1 [2022-12-13 13:40:23,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:40:23,637 INFO L321 Elim1Store]: treesize reduction 41, result has 2.4 percent of original size [2022-12-13 13:40:23,638 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 1 [2022-12-13 13:40:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:24,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976164157] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:40:24,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:40:24,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 21] total 53 [2022-12-13 13:40:24,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088658039] [2022-12-13 13:40:24,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:40:24,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-13 13:40:24,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:24,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-13 13:40:24,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2213, Unknown=42, NotChecked=396, Total=2862 [2022-12-13 13:40:24,121 INFO L87 Difference]: Start difference. First operand 359 states and 420 transitions. Second operand has 54 states, 53 states have (on average 2.207547169811321) internal successors, (117), 54 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:06,793 INFO L93 Difference]: Finished difference Result 539 states and 615 transitions. [2022-12-13 13:41:06,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-13 13:41:06,794 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.207547169811321) internal successors, (117), 54 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-12-13 13:41:06,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:06,796 INFO L225 Difference]: With dead ends: 539 [2022-12-13 13:41:06,796 INFO L226 Difference]: Without dead ends: 539 [2022-12-13 13:41:06,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1742 ImplicationChecksByTransitivity, 48.2s TimeCoverageRelationStatistics Valid=1192, Invalid=6614, Unknown=42, NotChecked=708, Total=8556 [2022-12-13 13:41:06,798 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 840 mSDsluCounter, 2002 mSDsCounter, 0 mSdLazyCounter, 3157 mSolverCounterSat, 206 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 4318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 3157 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 943 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:06,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 2101 Invalid, 4318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 3157 Invalid, 12 Unknown, 943 Unchecked, 18.7s Time] [2022-12-13 13:41:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-12-13 13:41:06,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 373. [2022-12-13 13:41:06,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 352 states have (on average 1.2386363636363635) internal successors, (436), 372 states have internal predecessors, (436), 0 states have call successors, (0), 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-12-13 13:41:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 436 transitions. [2022-12-13 13:41:06,803 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 436 transitions. Word has length 42 [2022-12-13 13:41:06,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:06,803 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 436 transitions. [2022-12-13 13:41:06,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.207547169811321) internal successors, (117), 54 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:06,803 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 436 transitions. [2022-12-13 13:41:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 13:41:06,804 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:06,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:06,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 13:41:07,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 13:41:07,006 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:41:07,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:07,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1035850057, now seen corresponding path program 1 times [2022-12-13 13:41:07,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:07,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700437724] [2022-12-13 13:41:07,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:07,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:07,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:07,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700437724] [2022-12-13 13:41:07,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700437724] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:41:07,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506767499] [2022-12-13 13:41:07,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:07,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:41:07,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:41:07,932 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:41:07,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 13:41:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:08,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 13:41:08,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:41:08,074 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-12-13 13:41:08,220 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:41:08,220 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-12-13 13:41:08,263 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-12-13 13:41:08,285 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 13 treesize of output 9 [2022-12-13 13:41:08,349 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 20 treesize of output 8 [2022-12-13 13:41:08,392 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 16 treesize of output 18 [2022-12-13 13:41:09,274 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-12-13 13:41:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:41:09,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:41:09,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506767499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:09,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:41:09,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 13 [2022-12-13 13:41:09,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953041687] [2022-12-13 13:41:09,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:09,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:41:09,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:09,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:41:09,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:41:09,285 INFO L87 Difference]: Start difference. First operand 373 states and 436 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 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-12-13 13:41:13,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:13,054 INFO L93 Difference]: Finished difference Result 397 states and 460 transitions. [2022-12-13 13:41:13,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 13:41:13,055 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-12-13 13:41:13,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:13,056 INFO L225 Difference]: With dead ends: 397 [2022-12-13 13:41:13,056 INFO L226 Difference]: Without dead ends: 397 [2022-12-13 13:41:13,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2022-12-13 13:41:13,057 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 235 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:13,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 439 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-12-13 13:41:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-12-13 13:41:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 381. [2022-12-13 13:41:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 360 states have (on average 1.2361111111111112) internal successors, (445), 380 states have internal predecessors, (445), 0 states have call successors, (0), 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-12-13 13:41:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 445 transitions. [2022-12-13 13:41:13,062 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 445 transitions. Word has length 43 [2022-12-13 13:41:13,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:13,062 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 445 transitions. [2022-12-13 13:41:13,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 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-12-13 13:41:13,062 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 445 transitions. [2022-12-13 13:41:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 13:41:13,063 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:13,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:13,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 13:41:13,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 13:41:13,265 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:41:13,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:13,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2046580944, now seen corresponding path program 1 times [2022-12-13 13:41:13,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:13,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175948922] [2022-12-13 13:41:13,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:13,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:14,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:14,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:14,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175948922] [2022-12-13 13:41:14,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175948922] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:41:14,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478827342] [2022-12-13 13:41:14,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:14,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:41:14,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:41:14,240 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:41:14,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 13:41:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:14,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 13:41:14,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:41:14,379 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-12-13 13:41:14,493 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:41:14,493 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-12-13 13:41:14,557 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 13 treesize of output 9 [2022-12-13 13:41:14,801 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:41:14,801 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 34 treesize of output 35 [2022-12-13 13:41:16,001 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-12-13 13:41:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:41:16,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:41:16,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478827342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:16,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:41:16,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 14 [2022-12-13 13:41:16,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697318754] [2022-12-13 13:41:16,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:16,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:41:16,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:16,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:41:16,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:41:16,023 INFO L87 Difference]: Start difference. First operand 381 states and 445 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:19,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:19,450 INFO L93 Difference]: Finished difference Result 395 states and 458 transitions. [2022-12-13 13:41:19,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:41:19,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-12-13 13:41:19,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:19,452 INFO L225 Difference]: With dead ends: 395 [2022-12-13 13:41:19,453 INFO L226 Difference]: Without dead ends: 395 [2022-12-13 13:41:19,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2022-12-13 13:41:19,453 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 173 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:19,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 340 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-13 13:41:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-12-13 13:41:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 382. [2022-12-13 13:41:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 361 states have (on average 1.2354570637119113) internal successors, (446), 381 states have internal predecessors, (446), 0 states have call successors, (0), 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-12-13 13:41:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 446 transitions. [2022-12-13 13:41:19,458 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 446 transitions. Word has length 44 [2022-12-13 13:41:19,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:19,458 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 446 transitions. [2022-12-13 13:41:19,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 446 transitions. [2022-12-13 13:41:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 13:41:19,459 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:19,459 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:19,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 13:41:19,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-13 13:41:19,660 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:41:19,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:19,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2059045047, now seen corresponding path program 1 times [2022-12-13 13:41:19,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:19,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508615982] [2022-12-13 13:41:19,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:19,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:22,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:22,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508615982] [2022-12-13 13:41:22,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508615982] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:41:22,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037959805] [2022-12-13 13:41:22,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:22,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:41:22,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:41:22,165 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:41:22,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 13:41:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:22,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 13:41:22,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:41:22,348 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-12-13 13:41:22,454 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-12-13 13:41:22,516 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:41:22,516 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-12-13 13:41:22,550 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-12-13 13:41:22,592 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 13 treesize of output 9 [2022-12-13 13:41:22,668 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 20 treesize of output 8 [2022-12-13 13:41:22,711 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 16 treesize of output 18 [2022-12-13 13:41:23,124 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:41:23,125 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-12-13 13:41:23,372 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-12-13 13:41:23,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:41:23,410 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-12-13 13:41:24,085 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:41:24,086 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 29 treesize of output 30 [2022-12-13 13:41:24,112 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 20 treesize of output 22 [2022-12-13 13:41:24,221 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 16 treesize of output 8 [2022-12-13 13:41:24,288 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 16 treesize of output 18 [2022-12-13 13:41:24,422 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 16 treesize of output 18 [2022-12-13 13:41:24,473 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 16 treesize of output 18 [2022-12-13 13:41:24,589 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-12-13 13:41:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:24,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:41:25,175 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2194 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2194) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12)) 2)) is different from false [2022-12-13 13:41:25,262 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2194 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2194) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12)))) is different from false [2022-12-13 13:41:25,290 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2194 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2194) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12)) 2)) is different from false [2022-12-13 13:41:25,329 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2191 (Array Int Int)) (v_ArrVal_2190 (Array Int Int)) (v_ArrVal_2194 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2191) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2190) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2194) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12)))) is different from false [2022-12-13 13:41:25,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:41:25,748 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 38 treesize of output 39 [2022-12-13 13:41:25,757 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 62 [2022-12-13 13:41:25,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 29 treesize of output 27 [2022-12-13 13:41:29,156 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2186 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_28| Int) (v_ArrVal_2185 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_100| Int) (v_ArrVal_2194 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_100| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2185))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_100| v_ArrVal_2186))) |v_ULTIMATE.start_main_#t~malloc7#1.base_28| v_ArrVal_2194) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12)) 2) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_28|) 0)))) is different from false [2022-12-13 13:41:29,487 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 13:41:29,487 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 13 treesize of output 12 [2022-12-13 13:41:32,643 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:41:32,644 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 47 [2022-12-13 13:41:32,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:41:32,665 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 42 treesize of output 38 [2022-12-13 13:41:32,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:41:32,682 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-12-13 13:41:32,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:41:32,694 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 21 treesize of output 13 [2022-12-13 13:41:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:32,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037959805] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:41:32,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:41:32,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 39 [2022-12-13 13:41:32,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108417219] [2022-12-13 13:41:32,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:41:32,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 13:41:32,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:32,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 13:41:32,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=944, Unknown=23, NotChecked=340, Total=1482 [2022-12-13 13:41:32,924 INFO L87 Difference]: Start difference. First operand 382 states and 446 transitions. Second operand has 39 states, 39 states have (on average 2.3333333333333335) internal successors, (91), 39 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-12-13 13:41:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:41:49,807 INFO L93 Difference]: Finished difference Result 557 states and 642 transitions. [2022-12-13 13:41:49,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 13:41:49,808 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.3333333333333335) internal successors, (91), 39 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) Word has length 44 [2022-12-13 13:41:49,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:41:49,808 INFO L225 Difference]: With dead ends: 557 [2022-12-13 13:41:49,809 INFO L226 Difference]: Without dead ends: 557 [2022-12-13 13:41:49,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=723, Invalid=3297, Unknown=32, NotChecked=640, Total=4692 [2022-12-13 13:41:49,809 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 742 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 103 mSolverCounterUnsat, 47 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 2554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 47 IncrementalHoareTripleChecker+Unknown, 766 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:41:49,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1265 Invalid, 2554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1638 Invalid, 47 Unknown, 766 Unchecked, 9.0s Time] [2022-12-13 13:41:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-12-13 13:41:49,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 428. [2022-12-13 13:41:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 407 states have (on average 1.2260442260442261) internal successors, (499), 427 states have internal predecessors, (499), 0 states have call successors, (0), 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-12-13 13:41:49,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 499 transitions. [2022-12-13 13:41:49,813 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 499 transitions. Word has length 44 [2022-12-13 13:41:49,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:41:49,813 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 499 transitions. [2022-12-13 13:41:49,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.3333333333333335) internal successors, (91), 39 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-12-13 13:41:49,813 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 499 transitions. [2022-12-13 13:41:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 13:41:49,813 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:41:49,814 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:49,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 13:41:50,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 13:41:50,015 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:41:50,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:50,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1130278217, now seen corresponding path program 1 times [2022-12-13 13:41:50,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:50,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213989252] [2022-12-13 13:41:50,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:50,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:53,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:53,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213989252] [2022-12-13 13:41:53,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213989252] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:41:53,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854292756] [2022-12-13 13:41:53,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:53,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:41:53,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:41:53,229 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:41:53,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 13:41:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:53,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-13 13:41:53,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:41:53,378 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-12-13 13:41:53,624 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-12-13 13:41:53,653 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-12-13 13:41:54,239 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:41:54,240 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-12-13 13:41:54,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:41:54,497 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-12-13 13:41:54,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:41:54,547 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-12-13 13:41:55,317 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:41:55,318 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 38 treesize of output 37 [2022-12-13 13:41:55,349 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-12-13 13:41:56,298 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:41:56,298 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 29 [2022-12-13 13:41:56,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:41:56,318 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 23 [2022-12-13 13:41:56,642 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:41:56,642 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 29 [2022-12-13 13:41:56,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:41:56,674 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 23 [2022-12-13 13:41:56,797 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:41:56,797 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-12-13 13:41:57,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:41:57,278 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2022-12-13 13:41:57,278 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 38 treesize of output 36 [2022-12-13 13:41:57,292 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 23 [2022-12-13 13:41:58,205 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-12-13 13:41:58,206 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 63 [2022-12-13 13:41:58,237 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 27 treesize of output 27 [2022-12-13 13:41:58,270 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 12 [2022-12-13 13:41:59,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:41:59,508 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 27 treesize of output 11 [2022-12-13 13:41:59,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:41:59,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:41:59,528 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 26 treesize of output 10 [2022-12-13 13:41:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:59,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:42:00,571 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_2345 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2345) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_2346 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2346) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) is different from false [2022-12-13 13:42:00,626 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_2346 (Array Int Int)) (v_ArrVal_2343 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2343) |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_2346) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_2345 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)) |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_2345) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2022-12-13 13:42:00,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:42:00,979 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 1 case distinctions, treesize of input 20 treesize of output 24 [2022-12-13 13:42:03,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:42:03,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 112 treesize of output 134 [2022-12-13 13:42:03,134 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-12-13 13:42:03,229 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 15 treesize of output 7 [2022-12-13 13:42:03,294 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-12-13 13:42:03,418 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_2337 (Array Int Int)) (v_ArrVal_2336 (Array Int Int)) (v_ArrVal_2346 (Array Int Int)) (v_ArrVal_2343 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc11#1.base_19| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc11#1.base_19| |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (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| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2337) (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2336) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2343) |v_ULTIMATE.start_main_#t~malloc11#1.base_19| v_ArrVal_2346) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_2345 (Array Int Int)) (v_subst_5 Int) (v_prenex_77 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_21 (+ 8 v_subst_5)))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_prenex_77))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_arrayElimArr_21)) .cse3 v_ArrVal_2345) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (= .cse3 |c_ULTIMATE.start_main_~x~0#1.base|)))))) is different from false [2022-12-13 13:42:11,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:42:11,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:42:11,359 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 48 [2022-12-13 13:42:11,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:42:11,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:42:11,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 242 treesize of output 164 [2022-12-13 13:42:11,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:42:11,412 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 140 treesize of output 128 [2022-12-13 13:42:11,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:42:11,427 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 0 case distinctions, treesize of input 117 treesize of output 97 [2022-12-13 13:42:11,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:42:11,528 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-12-13 13:42:11,528 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 1 [2022-12-13 13:42:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:42:11,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854292756] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:42:11,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:42:11,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 47 [2022-12-13 13:42:11,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447257348] [2022-12-13 13:42:11,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:42:11,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-13 13:42:11,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:11,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-13 13:42:11,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1591, Unknown=46, NotChecked=258, Total=2162 [2022-12-13 13:42:11,880 INFO L87 Difference]: Start difference. First operand 428 states and 499 transitions. Second operand has 47 states, 47 states have (on average 2.6595744680851063) internal successors, (125), 47 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:42:34,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:42:34,309 INFO L93 Difference]: Finished difference Result 542 states and 625 transitions. [2022-12-13 13:42:34,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 13:42:34,309 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.6595744680851063) internal successors, (125), 47 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-12-13 13:42:34,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:42:34,311 INFO L225 Difference]: With dead ends: 542 [2022-12-13 13:42:34,311 INFO L226 Difference]: Without dead ends: 542 [2022-12-13 13:42:34,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=696, Invalid=3301, Unknown=47, NotChecked=378, Total=4422 [2022-12-13 13:42:34,311 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 478 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 79 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 541 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-12-13 13:42:34,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1748 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2110 Invalid, 7 Unknown, 541 Unchecked, 10.9s Time] [2022-12-13 13:42:34,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-12-13 13:42:34,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 421. [2022-12-13 13:42:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 400 states have (on average 1.225) internal successors, (490), 420 states have internal predecessors, (490), 0 states have call successors, (0), 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-12-13 13:42:34,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 490 transitions. [2022-12-13 13:42:34,317 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 490 transitions. Word has length 44 [2022-12-13 13:42:34,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:42:34,317 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 490 transitions. [2022-12-13 13:42:34,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.6595744680851063) internal successors, (125), 47 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:42:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 490 transitions. [2022-12-13 13:42:34,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 13:42:34,318 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:42:34,318 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:42:34,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 13:42:34,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:42:34,519 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:42:34,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:34,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1233131070, now seen corresponding path program 1 times [2022-12-13 13:42:34,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:34,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895737790] [2022-12-13 13:42:34,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:34,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:42:36,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:36,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895737790] [2022-12-13 13:42:36,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895737790] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:42:36,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844750412] [2022-12-13 13:42:36,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:36,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:42:36,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:42:36,570 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:42:36,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 13:42:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:36,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 13:42:36,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:42:36,736 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-12-13 13:42:36,939 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:42:36,940 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-12-13 13:42:37,105 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-12-13 13:42:37,557 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:42:37,558 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 19 treesize of output 22 [2022-12-13 13:42:38,035 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:42:38,036 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 22 treesize of output 22 [2022-12-13 13:42:38,397 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:42:38,399 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 22 treesize of output 22 [2022-12-13 13:42:38,480 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:42:38,481 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-12-13 13:42:39,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:42:39,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:42:39,259 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 25 treesize of output 16 [2022-12-13 13:42:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:42:39,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:42:40,773 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-12-13 13:42:40,773 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 19 treesize of output 18 [2022-12-13 13:42:41,902 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2469 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_108| Int) (v_ArrVal_2466 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2466))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2469) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_108| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_108|)))) is different from false [2022-12-13 13:42:42,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:42:42,434 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 51 treesize of output 36 [2022-12-13 13:42:42,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:42:42,484 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 330 treesize of output 265 [2022-12-13 13:42:42,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:42:42,536 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 250 treesize of output 222 [2022-12-13 13:42:42,553 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 214 treesize of output 198 [2022-12-13 13:42:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:42:45,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844750412] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:42:45,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:42:45,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 36 [2022-12-13 13:42:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194542902] [2022-12-13 13:42:45,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:42:45,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-13 13:42:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:45,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-13 13:42:45,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1126, Unknown=14, NotChecked=68, Total=1332 [2022-12-13 13:42:45,248 INFO L87 Difference]: Start difference. First operand 421 states and 490 transitions. Second operand has 37 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 37 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-12-13 13:43:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:43:01,279 INFO L93 Difference]: Finished difference Result 656 states and 749 transitions. [2022-12-13 13:43:01,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 13:43:01,280 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 37 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) Word has length 44 [2022-12-13 13:43:01,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:43:01,282 INFO L225 Difference]: With dead ends: 656 [2022-12-13 13:43:01,282 INFO L226 Difference]: Without dead ends: 656 [2022-12-13 13:43:01,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=656, Invalid=3240, Unknown=14, NotChecked=122, Total=4032 [2022-12-13 13:43:01,283 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 1381 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 2013 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 2438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 2013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:43:01,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 1371 Invalid, 2438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 2013 Invalid, 0 Unknown, 239 Unchecked, 10.1s Time] [2022-12-13 13:43:01,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-12-13 13:43:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 472. [2022-12-13 13:43:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 451 states have (on average 1.2239467849223946) internal successors, (552), 471 states have internal predecessors, (552), 0 states have call successors, (0), 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-12-13 13:43:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 552 transitions. [2022-12-13 13:43:01,290 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 552 transitions. Word has length 44 [2022-12-13 13:43:01,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:43:01,290 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 552 transitions. [2022-12-13 13:43:01,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 37 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-12-13 13:43:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 552 transitions. [2022-12-13 13:43:01,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 13:43:01,291 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:43:01,291 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:43:01,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 13:43:01,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:43:01,493 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:43:01,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:43:01,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1233131069, now seen corresponding path program 1 times [2022-12-13 13:43:01,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:43:01,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397532067] [2022-12-13 13:43:01,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:43:01,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:43:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:43:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:43:02,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:43:02,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397532067] [2022-12-13 13:43:02,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397532067] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:43:02,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011522042] [2022-12-13 13:43:02,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:43:02,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:43:02,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:43:02,940 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:43:02,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 13:43:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:43:03,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 13:43:03,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:43:03,098 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-12-13 13:43:03,558 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-12-13 13:43:03,636 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:43:03,637 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-12-13 13:43:03,827 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-12-13 13:43:03,858 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-12-13 13:43:04,466 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:43:04,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-12-13 13:43:04,480 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-12-13 13:43:05,123 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 13:43:05,123 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 14 treesize of output 20 [2022-12-13 13:43:05,154 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-12-13 13:43:05,226 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:43:05,227 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 29 [2022-12-13 13:43:05,591 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:43:05,592 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 29 [2022-12-13 13:43:05,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:43:05,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 14 treesize of output 16 [2022-12-13 13:43:05,710 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:43:05,711 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-12-13 13:43:05,731 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-12-13 13:43:06,655 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:43:06,655 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:43:06,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:43:06,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:43:06,673 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 25 treesize of output 16 [2022-12-13 13:43:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:43:07,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:43:12,315 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2600 (Array Int Int)) (v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2593 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_113| Int)) (or (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2594) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2593) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2600) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_113|) 12)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_113| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_113|)))) (forall ((v_ArrVal_2600 (Array Int Int)) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2593 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_113| Int)) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2593))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2594) .cse0 v_ArrVal_2600) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_113|) 16) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_2599) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_113|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_113| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_113|))))) is different from false [2022-12-13 13:43:12,400 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_2600 (Array Int Int)) (v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2593 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_113| Int)) (or (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2594) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2593) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2600) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_113|) 12)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_113| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_113|)))) (forall ((v_ArrVal_2600 (Array Int Int)) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2594 (Array Int Int)) (v_ArrVal_2593 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_113| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_113| |c_ULTIMATE.start_main_~head~0#1.offset|)) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2593))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 16 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2594) .cse1 v_ArrVal_2600) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_113|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2599) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_113|))))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_113|)))))) is different from false [2022-12-13 13:43:12,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:43:12,507 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 73 treesize of output 74 [2022-12-13 13:43:12,530 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:43:12,531 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 65 treesize of output 50 [2022-12-13 13:43:12,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:43:12,595 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 334 treesize of output 301 [2022-12-13 13:43:12,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:43:12,680 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 598 treesize of output 573 [2022-12-13 13:43:12,704 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 558 treesize of output 534 [2022-12-13 13:43:12,722 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 534 treesize of output 510 [2022-12-13 13:43:12,740 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 510 treesize of output 502 [2022-12-13 13:43:12,796 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:43:12,796 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 502 treesize of output 458 [2022-12-13 13:43:16,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:43:16,547 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 38 treesize of output 39 [2022-12-13 13:43:16,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:43:16,576 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 30 treesize of output 31 [2022-12-13 13:43:16,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:43:16,594 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 28 treesize of output 20 [2022-12-13 13:43:16,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:43:16,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:43:16,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:43:16,623 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-12-13 13:43:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:43:18,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011522042] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:43:18,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:43:18,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2022-12-13 13:43:18,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435245827] [2022-12-13 13:43:18,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:43:18,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 13:43:18,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:43:18,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 13:43:18,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1009, Unknown=7, NotChecked=130, Total=1260 [2022-12-13 13:43:18,528 INFO L87 Difference]: Start difference. First operand 472 states and 552 transitions. Second operand has 36 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 36 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:43:35,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:43:35,795 INFO L93 Difference]: Finished difference Result 620 states and 710 transitions. [2022-12-13 13:43:35,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 13:43:35,796 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 36 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-12-13 13:43:35,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:43:35,797 INFO L225 Difference]: With dead ends: 620 [2022-12-13 13:43:35,798 INFO L226 Difference]: Without dead ends: 620 [2022-12-13 13:43:35,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=418, Invalid=2339, Unknown=7, NotChecked=206, Total=2970 [2022-12-13 13:43:35,798 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 841 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 2415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 441 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-12-13 13:43:35,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1293 Invalid, 2415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1870 Invalid, 0 Unknown, 441 Unchecked, 9.8s Time] [2022-12-13 13:43:35,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-12-13 13:43:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 522. [2022-12-13 13:43:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 501 states have (on average 1.221556886227545) internal successors, (612), 521 states have internal predecessors, (612), 0 states have call successors, (0), 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-12-13 13:43:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 612 transitions. [2022-12-13 13:43:35,804 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 612 transitions. Word has length 44 [2022-12-13 13:43:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:43:35,805 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 612 transitions. [2022-12-13 13:43:35,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 36 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:43:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 612 transitions. [2022-12-13 13:43:35,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 13:43:35,806 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:43:35,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:43:35,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 13:43:36,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-13 13:43:36,008 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:43:36,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:43:36,009 INFO L85 PathProgramCache]: Analyzing trace with hash -980499925, now seen corresponding path program 1 times [2022-12-13 13:43:36,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:43:36,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428363794] [2022-12-13 13:43:36,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:43:36,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:43:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:43:36,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:43:36,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:43:36,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428363794] [2022-12-13 13:43:36,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428363794] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:43:36,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847058394] [2022-12-13 13:43:36,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:43:36,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:43:36,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:43:36,921 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:43:36,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 13:43:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:43:37,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 13:43:37,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:43:37,084 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-12-13 13:43:37,252 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:43:37,252 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-12-13 13:43:37,379 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 13 treesize of output 9 [2022-12-13 13:43:37,799 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:43:37,799 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 34 treesize of output 35 [2022-12-13 13:43:39,434 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-12-13 13:43:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:43:39,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:43:39,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847058394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:43:39,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:43:39,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-12-13 13:43:39,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188020121] [2022-12-13 13:43:39,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:43:39,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:43:39,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:43:39,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:43:39,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:43:39,641 INFO L87 Difference]: Start difference. First operand 522 states and 612 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:43:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:43:42,411 INFO L93 Difference]: Finished difference Result 526 states and 616 transitions. [2022-12-13 13:43:42,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:43:42,412 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-12-13 13:43:42,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:43:42,414 INFO L225 Difference]: With dead ends: 526 [2022-12-13 13:43:42,414 INFO L226 Difference]: Without dead ends: 526 [2022-12-13 13:43:42,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-12-13 13:43:42,414 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 128 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:43:42,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 348 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-13 13:43:42,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-12-13 13:43:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 523. [2022-12-13 13:43:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 502 states have (on average 1.2211155378486056) internal successors, (613), 522 states have internal predecessors, (613), 0 states have call successors, (0), 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-12-13 13:43:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 613 transitions. [2022-12-13 13:43:42,420 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 613 transitions. Word has length 45 [2022-12-13 13:43:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:43:42,420 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 613 transitions. [2022-12-13 13:43:42,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:43:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 613 transitions. [2022-12-13 13:43:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 13:43:42,421 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:43:42,421 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:43:42,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 13:43:42,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-13 13:43:42,622 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:43:42,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:43:42,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1235369062, now seen corresponding path program 1 times [2022-12-13 13:43:42,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:43:42,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006603330] [2022-12-13 13:43:42,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:43:42,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:43:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:43:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:43:45,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:43:45,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006603330] [2022-12-13 13:43:45,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006603330] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:43:45,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812305591] [2022-12-13 13:43:45,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:43:45,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:43:45,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:43:45,303 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:43:45,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 13:43:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:43:45,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-13 13:43:45,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:43:45,471 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-12-13 13:43:45,660 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:43:45,660 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-12-13 13:43:45,918 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 13 treesize of output 9 [2022-12-13 13:43:46,280 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:43:46,281 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 34 treesize of output 35 [2022-12-13 13:43:46,862 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-12-13 13:43:46,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-12-13 13:43:47,277 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 13:43:47,277 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 43 treesize of output 36 [2022-12-13 13:43:48,387 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:43:48,388 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 79 treesize of output 72 [2022-12-13 13:43:49,867 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:43:49,868 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 98 treesize of output 84 [2022-12-13 13:43:50,283 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:43:50,283 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 98 treesize of output 84 [2022-12-13 13:43:50,783 INFO L321 Elim1Store]: treesize reduction 86, result has 41.9 percent of original size [2022-12-13 13:43:50,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 108 treesize of output 154 [2022-12-13 13:43:51,779 INFO L321 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2022-12-13 13:43:51,780 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 119 treesize of output 77 [2022-12-13 13:43:53,612 INFO L321 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2022-12-13 13:43:53,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 228 treesize of output 194 [2022-12-13 13:43:54,295 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 142 treesize of output 138 [2022-12-13 13:43:54,617 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 14 [2022-12-13 13:43:55,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:43:55,281 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 142 treesize of output 131 [2022-12-13 13:44:12,993 WARN L233 SmtUtils]: Spent 10.22s on a formula simplification. DAG size of input: 96 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:44:14,139 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 13:44:14,140 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 44 treesize of output 20 [2022-12-13 13:44:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:44:14,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:44:14,532 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2836 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_2836) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2022-12-13 13:44:19,356 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:44:19,356 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 1 case distinctions, treesize of input 25 treesize of output 29 [2022-12-13 13:44:22,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:44:22,968 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 167 treesize of output 117 [2022-12-13 13:44:22,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:44:22,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:44:22,982 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 108 treesize of output 104 [2022-12-13 13:44:22,993 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 109 treesize of output 89 [2022-12-13 13:44:23,014 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 44 treesize of output 40 [2022-12-13 13:44:23,036 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 54 treesize of output 46 [2022-12-13 13:44:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:44:24,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812305591] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:44:24,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:44:24,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 20] total 49 [2022-12-13 13:44:24,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530905244] [2022-12-13 13:44:24,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:44:24,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-13 13:44:24,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:44:24,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-13 13:44:24,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2063, Unknown=23, NotChecked=94, Total=2450 [2022-12-13 13:44:24,512 INFO L87 Difference]: Start difference. First operand 523 states and 613 transitions. Second operand has 50 states, 49 states have (on average 2.3877551020408165) internal successors, (117), 50 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:44:55,973 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 [0, 1] [2022-12-13 13:45:04,992 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 [0, 1] [2022-12-13 13:45:06,736 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 [0, 1] [2022-12-13 13:45:17,299 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-12-13 13:45:25,779 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-12-13 13:45:37,539 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-12-13 13:45:39,652 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-12-13 13:45:41,774 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-12-13 13:45:44,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:45:46,564 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-12-13 13:46:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:46:10,326 INFO L93 Difference]: Finished difference Result 835 states and 966 transitions. [2022-12-13 13:46:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-12-13 13:46:10,327 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.3877551020408165) internal successors, (117), 50 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-12-13 13:46:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:46:10,329 INFO L225 Difference]: With dead ends: 835 [2022-12-13 13:46:10,329 INFO L226 Difference]: Without dead ends: 835 [2022-12-13 13:46:10,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4943 ImplicationChecksByTransitivity, 95.4s TimeCoverageRelationStatistics Valid=2108, Invalid=13744, Unknown=154, NotChecked=250, Total=16256 [2022-12-13 13:46:10,331 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 1363 mSDsluCounter, 2063 mSDsCounter, 0 mSdLazyCounter, 3213 mSolverCounterSat, 281 mSolverCounterUnsat, 82 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 2168 SdHoareTripleChecker+Invalid, 3919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 3213 IncrementalHoareTripleChecker+Invalid, 82 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 42.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:46:10,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 2168 Invalid, 3919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 3213 Invalid, 82 Unknown, 343 Unchecked, 42.0s Time] [2022-12-13 13:46:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-12-13 13:46:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 540. [2022-12-13 13:46:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 519 states have (on average 1.2138728323699421) internal successors, (630), 539 states have internal predecessors, (630), 0 states have call successors, (0), 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-12-13 13:46:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 630 transitions. [2022-12-13 13:46:10,337 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 630 transitions. Word has length 46 [2022-12-13 13:46:10,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:46:10,337 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 630 transitions. [2022-12-13 13:46:10,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.3877551020408165) internal successors, (117), 50 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:46:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 630 transitions. [2022-12-13 13:46:10,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 13:46:10,338 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:46:10,338 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:46:10,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 13:46:10,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:46:10,539 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:46:10,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:46:10,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1235369063, now seen corresponding path program 1 times [2022-12-13 13:46:10,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:46:10,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317796478] [2022-12-13 13:46:10,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:46:10,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:46:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:46:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:46:15,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:46:15,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317796478] [2022-12-13 13:46:15,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317796478] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:46:15,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093092286] [2022-12-13 13:46:15,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:46:15,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:46:15,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:46:15,030 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:46:15,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 13:46:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:46:15,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 84 conjunts are in the unsatisfiable core [2022-12-13 13:46:15,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:46:15,211 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-12-13 13:46:15,580 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:46:15,580 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-12-13 13:46:15,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:46:15,906 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 13 treesize of output 9 [2022-12-13 13:46:15,954 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-12-13 13:46:16,682 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:46:16,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 57 treesize of output 54 [2022-12-13 13:46:16,711 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 22 treesize of output 24 [2022-12-13 13:46:17,420 INFO L321 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-12-13 13:46:17,420 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 1 case distinctions, treesize of input 18 treesize of output 30 [2022-12-13 13:46:17,624 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-12-13 13:46:17,624 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 22 treesize of output 24 [2022-12-13 13:46:17,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:46:17,985 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 43 treesize of output 30 [2022-12-13 13:46:18,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:46:18,057 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-12-13 13:46:19,089 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:46:19,089 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 64 treesize of output 57 [2022-12-13 13:46:19,146 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-12-13 13:46:20,414 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:46:20,414 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 57 treesize of output 49 [2022-12-13 13:46:20,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:46:20,444 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 23 [2022-12-13 13:46:20,800 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:46:20,800 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 57 treesize of output 49 [2022-12-13 13:46:20,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:46:20,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 23 treesize of output 23 [2022-12-13 13:46:20,972 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:46:20,972 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-12-13 13:46:21,055 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-12-13 13:46:21,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 13:46:21,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:46:21,607 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2022-12-13 13:46:21,607 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 64 treesize of output 46 [2022-12-13 13:46:21,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:46:21,628 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 23 [2022-12-13 13:46:22,732 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-12-13 13:46:22,733 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 92 [2022-12-13 13:46:22,752 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 27 treesize of output 27 [2022-12-13 13:46:22,807 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 29 treesize of output 17 [2022-12-13 13:46:26,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:46:26,178 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 6 case distinctions, treesize of input 126 treesize of output 133 [2022-12-13 13:46:26,322 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:46:26,323 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 3 case distinctions, treesize of input 68 treesize of output 76 [2022-12-13 13:46:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:46:27,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:46:28,983 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_3010 (Array Int Int)) (v_ArrVal_3009 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3010) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3009) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))) (forall ((v_ArrVal_3010 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3010) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) is different from false [2022-12-13 13:46:29,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:46:29,972 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 1 case distinctions, treesize of input 39 treesize of output 43 [2022-12-13 13:46:35,123 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:46:35,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 165 treesize of output 187 [2022-12-13 13:46:35,388 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-12-13 13:46:35,402 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 12 [2022-12-13 13:46:55,382 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:46:55,382 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 205 treesize of output 196 [2022-12-13 13:46:55,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:46:55,407 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 185 treesize of output 136 [2022-12-13 13:46:55,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:46:55,424 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:46:55,432 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 432 treesize of output 428 [2022-12-13 13:46:55,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:46:55,444 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:46:55,451 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 522 treesize of output 512 [2022-12-13 13:46:55,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:46:55,505 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 511 treesize of output 451 [2022-12-13 13:46:55,517 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:46:55,524 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 428 treesize of output 412 [2022-12-13 13:46:55,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:46:55,543 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 408 treesize of output 388 [2022-12-13 13:46:55,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:46:55,571 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 192 treesize of output 176 [2022-12-13 13:46:55,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:46:55,596 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 182 treesize of output 170 [2022-12-13 13:46:55,610 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 342 treesize of output 318 [2022-12-13 13:46:55,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:46:55,783 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 93 treesize of output 84 [2022-12-13 13:46:55,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:46:55,808 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 73 treesize of output 64 [2022-12-13 13:46:55,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:46:55,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:46:55,829 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 160 treesize of output 156 [2022-12-13 13:46:55,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:46:55,844 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 126 treesize of output 120 [2022-12-13 13:46:55,854 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:46:55,861 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 54 treesize of output 50 [2022-12-13 13:46:55,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:46:55,877 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 64 treesize of output 56 [2022-12-13 13:46:55,889 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 102 treesize of output 94 [2022-12-13 13:46:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:46:59,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093092286] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:46:59,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:46:59,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 20] total 54 [2022-12-13 13:46:59,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096718530] [2022-12-13 13:46:59,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:46:59,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-13 13:46:59,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:46:59,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-13 13:46:59,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2490, Unknown=81, NotChecked=104, Total=2970 [2022-12-13 13:46:59,257 INFO L87 Difference]: Start difference. First operand 540 states and 630 transitions. Second operand has 55 states, 54 states have (on average 2.5) internal successors, (135), 55 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-12-13 13:47:07,330 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (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| |c_ULTIMATE.start_main_#t~malloc7#1.offset|))) (.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|))) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_2999 (Array Int Int)) (v_ArrVal_3010 (Array Int Int)) (v_ArrVal_3000 (Array Int Int)) (v_subst_8 Int) (v_ArrVal_3006 (Array Int Int)) (v_ArrVal_3009 (Array Int Int)) (v_arrayElimArr_31 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_31 (+ 8 v_subst_8)))) (or (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_3000))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 4 (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2999) .cse1 v_ArrVal_3006) .cse2 v_ArrVal_3010) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (select (store |c_#length| .cse2 16) (select (select (store (store .cse4 .cse1 v_arrayElimArr_31) .cse2 v_ArrVal_3009) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))))) (= .cse2 |c_ULTIMATE.start_main_~x~0#1.base|)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_prenex_107 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc11#1.base_27| Int) (v_prenex_104 (Array Int Int)) (v_prenex_105 (Array Int Int)) (v_prenex_106 (Array Int Int))) (or (= |v_ULTIMATE.start_main_#t~malloc11#1.base_27| |c_ULTIMATE.start_main_~x~0#1.base|) (<= 0 (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_prenex_104) (select (select (store .cse5 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_prenex_106) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_prenex_107) |v_ULTIMATE.start_main_#t~malloc11#1.base_27| v_prenex_105) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1))) is different from false [2022-12-13 13:47:10,754 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-12-13 13:47:26,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:47:31,555 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-12-13 13:47:43,512 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-12-13 13:47:45,528 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-12-13 13:47:47,715 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-12-13 13:47:50,734 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-12-13 13:47:53,567 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-12-13 13:47:59,759 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-12-13 13:48:01,773 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-12-13 13:48:03,936 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-12-13 13:48:07,693 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-12-13 13:48:09,831 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-12-13 13:48:11,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:48:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:48:49,941 INFO L93 Difference]: Finished difference Result 1097 states and 1267 transitions. [2022-12-13 13:48:49,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-13 13:48:49,942 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.5) internal successors, (135), 55 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) Word has length 46 [2022-12-13 13:48:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:48:49,944 INFO L225 Difference]: With dead ends: 1097 [2022-12-13 13:48:49,944 INFO L226 Difference]: Without dead ends: 1097 [2022-12-13 13:48:49,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 2566 ImplicationChecksByTransitivity, 71.9s TimeCoverageRelationStatistics Valid=969, Invalid=7270, Unknown=141, NotChecked=362, Total=8742 [2022-12-13 13:48:49,945 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 922 mSDsluCounter, 3227 mSDsCounter, 0 mSdLazyCounter, 4568 mSolverCounterSat, 126 mSolverCounterUnsat, 115 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 3360 SdHoareTripleChecker+Invalid, 5107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 4568 IncrementalHoareTripleChecker+Invalid, 115 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 74.8s IncrementalHoareTripleChecker+Time [2022-12-13 13:48:49,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 3360 Invalid, 5107 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [126 Valid, 4568 Invalid, 115 Unknown, 298 Unchecked, 74.8s Time] [2022-12-13 13:48:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-12-13 13:48:49,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 540. [2022-12-13 13:48:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 519 states have (on average 1.211946050096339) internal successors, (629), 539 states have internal predecessors, (629), 0 states have call successors, (0), 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-12-13 13:48:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 629 transitions. [2022-12-13 13:48:49,953 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 629 transitions. Word has length 46 [2022-12-13 13:48:49,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:48:49,953 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 629 transitions. [2022-12-13 13:48:49,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.5) internal successors, (135), 55 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-12-13 13:48:49,953 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 629 transitions. [2022-12-13 13:48:49,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 13:48:49,954 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:48:49,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:48:49,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 13:48:50,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-13 13:48:50,156 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:48:50,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:50,157 INFO L85 PathProgramCache]: Analyzing trace with hash -107330537, now seen corresponding path program 1 times [2022-12-13 13:48:50,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:48:50,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94947159] [2022-12-13 13:48:50,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:50,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:48:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:50,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:48:50,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94947159] [2022-12-13 13:48:50,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94947159] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:48:50,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431609046] [2022-12-13 13:48:50,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:50,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:48:50,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:48:50,874 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:48:50,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 13:48:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:51,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 13:48:51,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:48:52,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:48:52,529 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 19 treesize of output 15 [2022-12-13 13:48:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:52,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:48:54,960 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 13:48:54,961 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 20 treesize of output 15 [2022-12-13 13:48:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:55,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431609046] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:48:55,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:48:55,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2022-12-13 13:48:55,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723002055] [2022-12-13 13:48:55,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:48:55,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 13:48:55,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:48:55,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 13:48:55,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2022-12-13 13:48:55,500 INFO L87 Difference]: Start difference. First operand 540 states and 629 transitions. Second operand has 25 states, 25 states have (on average 4.48) internal successors, (112), 25 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-12-13 13:49:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:49:01,999 INFO L93 Difference]: Finished difference Result 702 states and 808 transitions. [2022-12-13 13:49:02,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 13:49:02,000 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.48) internal successors, (112), 25 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 47 [2022-12-13 13:49:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:49:02,002 INFO L225 Difference]: With dead ends: 702 [2022-12-13 13:49:02,002 INFO L226 Difference]: Without dead ends: 702 [2022-12-13 13:49:02,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2022-12-13 13:49:02,003 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 277 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:49:02,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 943 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-12-13 13:49:02,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-12-13 13:49:02,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 646. [2022-12-13 13:49:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 625 states have (on average 1.216) internal successors, (760), 645 states have internal predecessors, (760), 0 states have call successors, (0), 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-12-13 13:49:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 760 transitions. [2022-12-13 13:49:02,010 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 760 transitions. Word has length 47 [2022-12-13 13:49:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:49:02,011 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 760 transitions. [2022-12-13 13:49:02,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.48) internal successors, (112), 25 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-12-13 13:49:02,011 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 760 transitions. [2022-12-13 13:49:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 13:49:02,011 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:49:02,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:49:02,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 13:49:02,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-13 13:49:02,212 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:49:02,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:49:02,213 INFO L85 PathProgramCache]: Analyzing trace with hash -431305, now seen corresponding path program 1 times [2022-12-13 13:49:02,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:49:02,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036595271] [2022-12-13 13:49:02,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:49:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:49:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:49:03,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:03,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:49:03,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036595271] [2022-12-13 13:49:03,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036595271] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:49:03,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276155982] [2022-12-13 13:49:03,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:49:03,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:49:03,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:49:03,219 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:49:03,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 13:49:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:49:03,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 13:49:03,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:49:06,284 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:49:06,285 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 45 treesize of output 41 [2022-12-13 13:49:06,322 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:49:06,322 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 35 [2022-12-13 13:49:07,115 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 13:49:07,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 13:49:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:07,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:49:08,397 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 36 treesize of output 32 [2022-12-13 13:49:10,859 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 13:49:10,859 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 25 [2022-12-13 13:49:10,909 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-12-13 13:49:10,910 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 24 treesize of output 12 [2022-12-13 13:49:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:11,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276155982] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:49:11,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:49:11,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 32 [2022-12-13 13:49:11,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143749018] [2022-12-13 13:49:11,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:49:11,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 13:49:11,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:49:11,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 13:49:11,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=884, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 13:49:11,740 INFO L87 Difference]: Start difference. First operand 646 states and 760 transitions. Second operand has 33 states, 32 states have (on average 4.25) internal successors, (136), 33 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:49:26,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:49:26,951 INFO L93 Difference]: Finished difference Result 794 states and 921 transitions. [2022-12-13 13:49:26,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-13 13:49:26,952 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.25) internal successors, (136), 33 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-12-13 13:49:26,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:49:26,954 INFO L225 Difference]: With dead ends: 794 [2022-12-13 13:49:26,954 INFO L226 Difference]: Without dead ends: 794 [2022-12-13 13:49:26,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=938, Invalid=3618, Unknown=0, NotChecked=0, Total=4556 [2022-12-13 13:49:26,954 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 641 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-12-13 13:49:26,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 659 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-12-13 13:49:26,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-12-13 13:49:26,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 738. [2022-12-13 13:49:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 717 states have (on average 1.2301255230125523) internal successors, (882), 737 states have internal predecessors, (882), 0 states have call successors, (0), 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-12-13 13:49:26,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 882 transitions. [2022-12-13 13:49:26,962 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 882 transitions. Word has length 48 [2022-12-13 13:49:26,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:49:26,962 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 882 transitions. [2022-12-13 13:49:26,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.25) internal successors, (136), 33 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:49:26,962 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 882 transitions. [2022-12-13 13:49:26,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 13:49:26,963 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:49:26,963 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:49:26,968 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 13:49:27,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-13 13:49:27,165 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:49:27,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:49:27,165 INFO L85 PathProgramCache]: Analyzing trace with hash 569911223, now seen corresponding path program 1 times [2022-12-13 13:49:27,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:49:27,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239178016] [2022-12-13 13:49:27,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:49:27,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:49:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:49:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:30,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:49:30,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239178016] [2022-12-13 13:49:30,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239178016] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:49:30,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403778635] [2022-12-13 13:49:30,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:49:30,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:49:30,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:49:30,198 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:49:30,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 13:49:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:49:30,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-13 13:49:30,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:49:30,371 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-12-13 13:49:30,482 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-12-13 13:49:30,545 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:49:30,545 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-12-13 13:49:30,581 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-12-13 13:49:30,603 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 13 treesize of output 9 [2022-12-13 13:49:30,695 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 20 treesize of output 8 [2022-12-13 13:49:30,758 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 16 treesize of output 18 [2022-12-13 13:49:31,174 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:49:31,174 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-12-13 13:49:31,506 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-12-13 13:49:31,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:49:31,536 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-12-13 13:49:32,256 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:49:32,256 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 29 treesize of output 30 [2022-12-13 13:49:32,279 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 20 treesize of output 22 [2022-12-13 13:49:32,437 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 16 treesize of output 8 [2022-12-13 13:49:32,947 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 16 treesize of output 18 [2022-12-13 13:49:33,099 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 16 treesize of output 18 [2022-12-13 13:49:33,194 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:49:33,195 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-12-13 13:49:33,462 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 13 treesize of output 9 [2022-12-13 13:49:33,501 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 16 treesize of output 18 [2022-12-13 13:49:33,787 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 20 treesize of output 8 [2022-12-13 13:49:34,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 16 treesize of output 18 [2022-12-13 13:49:34,582 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-12-13 13:49:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:34,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:49:34,977 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3317 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3317) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12)) 2)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~malloc11#1.base|))) is different from false [2022-12-13 13:49:37,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:49:37,173 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 52 treesize of output 53 [2022-12-13 13:49:37,185 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 84 treesize of output 76 [2022-12-13 13:49:37,197 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 68 treesize of output 66 [2022-12-13 13:49:37,295 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:49:37,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 73 treesize of output 91 [2022-12-13 13:49:50,537 WARN L233 SmtUtils]: Spent 12.54s on a formula simplification. DAG size of input: 35 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 13:49:59,778 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3313 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_48| Int) (v_arrayElimCell_401 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_141| Int) (v_ArrVal_3310 Int) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3307 (Array Int Int))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_3307))) (store .cse2 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_141| v_ArrVal_3310)))) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_48|) 0)) (= 2 (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_48| v_ArrVal_3313) v_arrayElimCell_401 v_ArrVal_3317) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_48| v_ArrVal_3317) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 2) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_141| |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-12-13 13:50:00,360 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 13:50:00,361 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 13 treesize of output 12 [2022-12-13 13:50:00,434 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3306 Int) (v_ArrVal_3313 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_48| Int) (v_arrayElimCell_401 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_141| Int) (v_ArrVal_3310 Int) (v_ArrVal_3317 (Array Int Int)) (v_ArrVal_3307 (Array Int Int))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8) v_ArrVal_3306)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_3307))) (store .cse2 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_141| v_ArrVal_3310)))) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12))) (or (= 2 (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_48| v_ArrVal_3317) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_48| |c_ULTIMATE.start_main_~head~0#1.base|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_141| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc7#1.base_48| v_ArrVal_3313) v_arrayElimCell_401 v_ArrVal_3317) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 2)))) is different from false [2022-12-13 13:50:03,228 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:50:03,228 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 76 [2022-12-13 13:50:03,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:50:03,251 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 107 treesize of output 101 [2022-12-13 13:50:03,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:50:03,269 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 38 [2022-12-13 13:50:03,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:50:03,285 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-12-13 13:50:03,288 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-13 13:50:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:50:03,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403778635] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:50:03,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:50:03,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 22] total 46 [2022-12-13 13:50:03,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693994787] [2022-12-13 13:50:03,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:50:03,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-13 13:50:03,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:50:03,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-13 13:50:03,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1524, Unknown=38, NotChecked=252, Total=2070 [2022-12-13 13:50:03,590 INFO L87 Difference]: Start difference. First operand 738 states and 882 transitions. Second operand has 46 states, 46 states have (on average 2.239130434782609) internal successors, (103), 46 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:50:21,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:50:21,471 INFO L93 Difference]: Finished difference Result 1028 states and 1232 transitions. [2022-12-13 13:50:21,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 13:50:21,472 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.239130434782609) internal successors, (103), 46 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-12-13 13:50:21,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:50:21,474 INFO L225 Difference]: With dead ends: 1028 [2022-12-13 13:50:21,474 INFO L226 Difference]: Without dead ends: 1028 [2022-12-13 13:50:21,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=761, Invalid=3905, Unknown=38, NotChecked=408, Total=5112 [2022-12-13 13:50:21,475 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 1000 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 2365 mSolverCounterSat, 120 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 3017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2365 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 531 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:50:21,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 1742 Invalid, 3017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2365 Invalid, 1 Unknown, 531 Unchecked, 12.3s Time] [2022-12-13 13:50:21,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2022-12-13 13:50:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 731. [2022-12-13 13:50:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 710 states have (on average 1.2295774647887323) internal successors, (873), 730 states have internal predecessors, (873), 0 states have call successors, (0), 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-12-13 13:50:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 873 transitions. [2022-12-13 13:50:21,483 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 873 transitions. Word has length 48 [2022-12-13 13:50:21,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:50:21,483 INFO L495 AbstractCegarLoop]: Abstraction has 731 states and 873 transitions. [2022-12-13 13:50:21,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.239130434782609) internal successors, (103), 46 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:50:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 873 transitions. [2022-12-13 13:50:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 13:50:21,484 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:50:21,484 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:50:21,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 13:50:21,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-13 13:50:21,686 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:50:21,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:50:21,687 INFO L85 PathProgramCache]: Analyzing trace with hash 424184003, now seen corresponding path program 1 times [2022-12-13 13:50:21,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:50:21,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351895497] [2022-12-13 13:50:21,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:50:21,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:50:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:50:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:50:24,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:50:24,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351895497] [2022-12-13 13:50:24,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351895497] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:50:24,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456228522] [2022-12-13 13:50:24,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:50:24,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:50:24,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:50:24,189 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:50:24,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cf33e52-e73c-4467-890e-26e9b525b026/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 13:50:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:50:24,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-13 13:50:24,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:50:24,366 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-12-13 13:50:25,011 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:50:25,012 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-12-13 13:50:25,297 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-12-13 13:50:25,333 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-12-13 13:50:26,086 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:50:26,087 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-12-13 13:50:26,103 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-12-13 13:50:26,869 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 13:50:26,870 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 14 treesize of output 20 [2022-12-13 13:50:26,891 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-12-13 13:50:26,980 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:50:26,980 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 29 [2022-12-13 13:50:27,591 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:50:27,592 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 29 [2022-12-13 13:50:27,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:50:27,684 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-12-13 13:50:28,090 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 13:50:28,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 13:50:28,242 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-12-13 13:50:28,243 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 20 treesize of output 22 [2022-12-13 13:50:28,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:50:28,689 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 37 treesize of output 28 [2022-12-13 13:50:28,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:50:28,755 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 14 treesize of output 16