./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/sll-lst-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 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_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/sll-lst-shared.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7ac435f9525efba17674735293ae04d2f777a83ec5e1b38ed3aaaf0148b05726 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:03:03,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:03:03,877 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2024-11-09 05:03:03,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:03:03,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:03:03,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:03:03,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:03:03,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:03:03,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:03:03,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:03:03,915 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:03:03,916 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:03:03,916 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:03:03,918 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:03:03,919 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:03:03,919 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:03:03,919 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:03:03,920 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:03:03,920 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:03:03,920 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:03:03,920 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:03:03,925 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:03:03,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:03:03,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:03:03,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:03:03,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:03:03,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:03:03,927 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:03:03,927 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:03:03,927 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:03:03,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:03:03,928 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:03:03,928 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:03:03,928 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:03:03,928 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:03:03,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:03:03,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:03:03,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:03:03,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:03:03,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:03:03,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:03:03,933 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:03:03,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:03:03,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:03:03,934 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:03:03,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:03:03,934 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/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_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ac435f9525efba17674735293ae04d2f777a83ec5e1b38ed3aaaf0148b05726 [2024-11-09 05:03:04,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:03:04,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:03:04,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:03:04,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:03:04,261 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:03:04,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/memsafety-broom/sll-lst-shared.i Unable to find full path for "g++" [2024-11-09 05:03:06,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:03:06,586 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:03:06,586 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/sv-benchmarks/c/memsafety-broom/sll-lst-shared.i [2024-11-09 05:03:06,615 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/data/a1d8f828b/31a1efa4be8d4ed08d93e47e1996c058/FLAGf54c51837 [2024-11-09 05:03:06,846 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/data/a1d8f828b/31a1efa4be8d4ed08d93e47e1996c058 [2024-11-09 05:03:06,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:03:06,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:03:06,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:03:06,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:03:06,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:03:06,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:03:06" (1/1) ... [2024-11-09 05:03:06,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758c346b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:03:06, skipping insertion in model container [2024-11-09 05:03:06,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:03:06" (1/1) ... [2024-11-09 05:03:06,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:03:07,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:03:07,286 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:03:07,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:03:07,358 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:03:07,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:03:07 WrapperNode [2024-11-09 05:03:07,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:03:07,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:03:07,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:03:07,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:03:07,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:03:07" (1/1) ... [2024-11-09 05:03:07,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:03:07" (1/1) ... [2024-11-09 05:03:07,412 INFO L138 Inliner]: procedures = 121, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 71 [2024-11-09 05:03:07,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:03:07,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:03:07,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:03:07,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:03:07,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:03:07" (1/1) ... [2024-11-09 05:03:07,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:03:07" (1/1) ... [2024-11-09 05:03:07,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:03:07" (1/1) ... [2024-11-09 05:03:07,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:03:07" (1/1) ... [2024-11-09 05:03:07,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:03:07" (1/1) ... [2024-11-09 05:03:07,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:03:07" (1/1) ... [2024-11-09 05:03:07,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:03:07" (1/1) ... [2024-11-09 05:03:07,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:03:07" (1/1) ... [2024-11-09 05:03:07,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:03:07,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:03:07,468 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:03:07,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:03:07,469 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:03:07" (1/1) ... [2024-11-09 05:03:07,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:03:07,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:03:07,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:03:07,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:03:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:03:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-09 05:03:07,544 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-09 05:03:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:03:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:03:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:03:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:03:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:03:07,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:03:07,663 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:03:07,666 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:03:08,002 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-09 05:03:08,002 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:03:08,081 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:03:08,081 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 05:03:08,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:03:08 BoogieIcfgContainer [2024-11-09 05:03:08,082 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:03:08,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:03:08,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:03:08,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:03:08,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:03:06" (1/3) ... [2024-11-09 05:03:08,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42421adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:03:08, skipping insertion in model container [2024-11-09 05:03:08,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:03:07" (2/3) ... [2024-11-09 05:03:08,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42421adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:03:08, skipping insertion in model container [2024-11-09 05:03:08,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:03:08" (3/3) ... [2024-11-09 05:03:08,093 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-lst-shared.i [2024-11-09 05:03:08,109 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:03:08,109 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-11-09 05:03:08,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:03:08,169 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@1acdc54c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:03:08,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-11-09 05:03:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 31 states have (on average 2.161290322580645) internal successors, (67), 60 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:03:08,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 05:03:08,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:08,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 05:03:08,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:08,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:08,189 INFO L85 PathProgramCache]: Analyzing trace with hash 4845364, now seen corresponding path program 1 times [2024-11-09 05:03:08,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:08,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846793758] [2024-11-09 05:03:08,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:08,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:08,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:08,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846793758] [2024-11-09 05:03:08,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846793758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:08,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:08,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:03:08,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254883602] [2024-11-09 05:03:08,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:08,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:03:08,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:08,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:03:08,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:03:08,560 INFO L87 Difference]: Start difference. First operand has 64 states, 31 states have (on average 2.161290322580645) internal successors, (67), 60 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:03:08,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:08,681 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2024-11-09 05:03:08,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:03:08,684 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 05:03:08,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:08,693 INFO L225 Difference]: With dead ends: 63 [2024-11-09 05:03:08,693 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 05:03:08,696 INFO L431 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 [2024-11-09 05:03:08,700 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:08,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:03:08,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 05:03:08,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-09 05:03:08,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 31 states have (on average 2.064516129032258) internal successors, (64), 58 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:03:08,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2024-11-09 05:03:08,744 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 4 [2024-11-09 05:03:08,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:08,745 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2024-11-09 05:03:08,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:03:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2024-11-09 05:03:08,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 05:03:08,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:08,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 05:03:08,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:03:08,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:08,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:08,747 INFO L85 PathProgramCache]: Analyzing trace with hash 4845365, now seen corresponding path program 1 times [2024-11-09 05:03:08,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:08,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255009426] [2024-11-09 05:03:08,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:08,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:08,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:08,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255009426] [2024-11-09 05:03:08,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255009426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:08,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:08,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:03:08,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286515763] [2024-11-09 05:03:08,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:08,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:03:08,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:08,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:03:08,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:03:08,893 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:03:08,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:08,990 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-11-09 05:03:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:03:08,991 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 05:03:08,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:08,992 INFO L225 Difference]: With dead ends: 61 [2024-11-09 05:03:08,992 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 05:03:08,993 INFO L431 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 [2024-11-09 05:03:08,994 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:08,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:03:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 05:03:09,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 05:03:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 31 states have (on average 2.032258064516129) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:03:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-11-09 05:03:09,008 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 4 [2024-11-09 05:03:09,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:09,009 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-11-09 05:03:09,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:03:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2024-11-09 05:03:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:03:09,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:09,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:09,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:03:09,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:09,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:09,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1677083508, now seen corresponding path program 1 times [2024-11-09 05:03:09,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:09,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652516939] [2024-11-09 05:03:09,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:09,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:09,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:09,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652516939] [2024-11-09 05:03:09,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652516939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:09,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:09,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:03:09,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354787940] [2024-11-09 05:03:09,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:09,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:03:09,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:09,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:03:09,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:03:09,150 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:09,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:09,260 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2024-11-09 05:03:09,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:03:09,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2024-11-09 05:03:09,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:09,265 INFO L225 Difference]: With dead ends: 64 [2024-11-09 05:03:09,266 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 05:03:09,266 INFO L431 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 [2024-11-09 05:03:09,272 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:09,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 86 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:03:09,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 05:03:09,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-11-09 05:03:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 31 states have (on average 2.0) internal successors, (62), 56 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:03:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2024-11-09 05:03:09,292 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 7 [2024-11-09 05:03:09,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:09,292 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2024-11-09 05:03:09,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2024-11-09 05:03:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:03:09,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:09,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:09,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:03:09,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:09,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1677083507, now seen corresponding path program 1 times [2024-11-09 05:03:09,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:09,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078775248] [2024-11-09 05:03:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:09,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:09,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:09,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:09,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078775248] [2024-11-09 05:03:09,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078775248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:09,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:09,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:03:09,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777885762] [2024-11-09 05:03:09,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:09,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:03:09,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:09,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:03:09,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:03:09,476 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:09,559 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2024-11-09 05:03:09,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:03:09,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2024-11-09 05:03:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:09,561 INFO L225 Difference]: With dead ends: 63 [2024-11-09 05:03:09,561 INFO L226 Difference]: Without dead ends: 63 [2024-11-09 05:03:09,561 INFO L431 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 [2024-11-09 05:03:09,562 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:09,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 91 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:03:09,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-09 05:03:09,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2024-11-09 05:03:09,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 31 states have (on average 1.967741935483871) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:03:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-11-09 05:03:09,575 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 7 [2024-11-09 05:03:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:09,576 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-09 05:03:09,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-11-09 05:03:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 05:03:09,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:09,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:09,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:03:09,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:09,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:09,580 INFO L85 PathProgramCache]: Analyzing trace with hash -449977615, now seen corresponding path program 1 times [2024-11-09 05:03:09,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:09,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152091674] [2024-11-09 05:03:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:09,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:09,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:09,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152091674] [2024-11-09 05:03:09,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152091674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:09,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:09,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:03:09,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916489896] [2024-11-09 05:03:09,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:09,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:03:09,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:09,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:03:09,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:03:09,817 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:09,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:09,966 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2024-11-09 05:03:09,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 05:03:09,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-11-09 05:03:09,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:09,968 INFO L225 Difference]: With dead ends: 60 [2024-11-09 05:03:09,968 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 05:03:09,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:03:09,969 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:09,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 161 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:03:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 05:03:09,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-11-09 05:03:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:03:09,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-11-09 05:03:09,975 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 8 [2024-11-09 05:03:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:09,975 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-09 05:03:09,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-11-09 05:03:09,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 05:03:09,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:09,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:09,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:03:09,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:09,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:09,977 INFO L85 PathProgramCache]: Analyzing trace with hash -449977614, now seen corresponding path program 1 times [2024-11-09 05:03:09,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:09,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515702413] [2024-11-09 05:03:09,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:09,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:10,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:10,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515702413] [2024-11-09 05:03:10,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515702413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:10,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:10,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:03:10,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12315761] [2024-11-09 05:03:10,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:10,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:03:10,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:10,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:03:10,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:03:10,187 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:10,348 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2024-11-09 05:03:10,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:03:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-11-09 05:03:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:10,349 INFO L225 Difference]: With dead ends: 59 [2024-11-09 05:03:10,350 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 05:03:10,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:03:10,351 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 4 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:10,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 179 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:03:10,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 05:03:10,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-11-09 05:03:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:03:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-11-09 05:03:10,365 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 8 [2024-11-09 05:03:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:10,365 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-09 05:03:10,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2024-11-09 05:03:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:03:10,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:10,366 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:10,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:03:10,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:10,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:10,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1930036949, now seen corresponding path program 1 times [2024-11-09 05:03:10,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:10,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242171534] [2024-11-09 05:03:10,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:10,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:10,494 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:10,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242171534] [2024-11-09 05:03:10,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242171534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:10,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:10,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:03:10,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038302358] [2024-11-09 05:03:10,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:10,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:03:10,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:10,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:03:10,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:03:10,497 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:10,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:10,639 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2024-11-09 05:03:10,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:03:10,640 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-09 05:03:10,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:10,642 INFO L225 Difference]: With dead ends: 73 [2024-11-09 05:03:10,642 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 05:03:10,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:03:10,643 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 19 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:10,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 123 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:03:10,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 05:03:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2024-11-09 05:03:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 62 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2024-11-09 05:03:10,658 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 14 [2024-11-09 05:03:10,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:10,658 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2024-11-09 05:03:10,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2024-11-09 05:03:10,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:03:10,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:10,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:10,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 05:03:10,664 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:10,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:10,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1930036948, now seen corresponding path program 1 times [2024-11-09 05:03:10,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:10,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299385784] [2024-11-09 05:03:10,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:10,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:10,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:10,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299385784] [2024-11-09 05:03:10,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299385784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:10,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:10,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:03:10,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096649530] [2024-11-09 05:03:10,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:10,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:03:10,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:10,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:03:10,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:03:10,942 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:11,139 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2024-11-09 05:03:11,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:03:11,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-09 05:03:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:11,140 INFO L225 Difference]: With dead ends: 74 [2024-11-09 05:03:11,140 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 05:03:11,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:03:11,143 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 19 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:11,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 242 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:03:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 05:03:11,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2024-11-09 05:03:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.813953488372093) internal successors, (78), 62 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2024-11-09 05:03:11,156 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 14 [2024-11-09 05:03:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:11,156 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2024-11-09 05:03:11,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:11,157 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2024-11-09 05:03:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:03:11,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:11,158 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:11,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 05:03:11,158 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:11,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:11,159 INFO L85 PathProgramCache]: Analyzing trace with hash 344007581, now seen corresponding path program 1 times [2024-11-09 05:03:11,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:11,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875336248] [2024-11-09 05:03:11,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:11,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:11,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:11,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875336248] [2024-11-09 05:03:11,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875336248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:11,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:11,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:03:11,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442232439] [2024-11-09 05:03:11,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:11,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:03:11,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:11,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:03:11,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:03:11,318 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:03:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:11,504 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2024-11-09 05:03:11,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:03:11,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-09 05:03:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:11,506 INFO L225 Difference]: With dead ends: 68 [2024-11-09 05:03:11,509 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 05:03:11,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:03:11,510 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:11,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 155 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:03:11,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 05:03:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-11-09 05:03:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 62 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:11,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2024-11-09 05:03:11,514 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 15 [2024-11-09 05:03:11,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:11,514 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2024-11-09 05:03:11,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:03:11,515 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2024-11-09 05:03:11,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:03:11,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:11,515 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:11,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 05:03:11,516 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:11,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:11,516 INFO L85 PathProgramCache]: Analyzing trace with hash 344007582, now seen corresponding path program 1 times [2024-11-09 05:03:11,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:11,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020818811] [2024-11-09 05:03:11,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:11,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:12,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:12,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020818811] [2024-11-09 05:03:12,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020818811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:03:12,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677753585] [2024-11-09 05:03:12,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:12,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:03:12,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:03:12,076 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:03:12,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:03:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:12,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 05:03:12,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:03:12,291 INFO L378 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 8 treesize of output 1 [2024-11-09 05:03:12,296 INFO L378 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 [2024-11-09 05:03:12,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:03:12,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 05:03:12,442 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:03:12,443 INFO L378 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 [2024-11-09 05:03:12,566 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-09 05:03:12,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:03:12,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 05:03:12,630 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:03:12,630 INFO L378 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 [2024-11-09 05:03:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 05:03:12,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:03:12,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677753585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:03:12,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [374846893] [2024-11-09 05:03:12,855 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2024-11-09 05:03:12,855 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:03:12,863 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:03:12,870 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:03:12,870 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:03:13,754 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 127 for LOIs [2024-11-09 05:03:13,945 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:03:25,567 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1320#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_create_~now~0#1.base_27| Int)) (and (or (and (not (= |ULTIMATE.start_create_~data~0#1.base| 0)) (<= (+ |ULTIMATE.start_create_~data~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (<= (+ |ULTIMATE.start_create_#t~ret8#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_55| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_56| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.offset_56| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_56| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |ULTIMATE.start_create_~data~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_56| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_56| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_55| |ULTIMATE.start_create_~data~0#1.base|) 0))) |v_#memory_$Pointer$.offset_55|)) (not (= |ULTIMATE.start_create_#t~ret8#1.base| 0)) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_55| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_53| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_53| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |ULTIMATE.start_create_~data~0#1.base| (store (select (store |v_#memory_$Pointer$.base_53| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_53| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_55| |ULTIMATE.start_create_~data~0#1.base|) 0))) |v_#memory_$Pointer$.base_55|)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_41| (Array Int (Array Int Int))) (|v_#memory_int_42| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int)))) (and (<= 0 (+ (select (select |v_#memory_int_41| |ULTIMATE.start_create_~data~0#1.base|) 0) 2147483648)) (= (store |v_#memory_int_41| |v_ULTIMATE.start_create_~now~0#1.base_27| (store (select |v_#memory_int_41| |v_ULTIMATE.start_create_~now~0#1.base_27|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_5| |v_ULTIMATE.start_create_~now~0#1.base_27|) 0))) |v_old(#memory_int)_AFTER_CALL_5|) (= (store |v_#memory_int_40| |ULTIMATE.start_create_~data~0#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_int_41| |ULTIMATE.start_create_~data~0#1.base|) 0))) |v_#memory_int_41|) (= |v_#memory_int_40| (store |v_#memory_int_42| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_42| |ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base|) 8)))) (<= (select (select |v_#memory_int_41| |ULTIMATE.start_create_~data~0#1.base|) 0) 2147483647))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_53| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.offset_53| |ULTIMATE.start_create_#t~ret8#1.base|) 8 0)))) (exists ((|v_#length_60| (Array Int Int))) (= |#length| (store |v_#length_60| |ULTIMATE.start_create_#t~ret8#1.base| 16))) (exists ((|v_#valid_75| (Array Int Int))) (and (= (select |v_#valid_75| |ULTIMATE.start_create_#t~ret8#1.base|) 0) (= (store |v_#valid_75| |ULTIMATE.start_create_#t~ret8#1.base| 1) |#valid|))) (exists ((|v_#length_62| (Array Int Int))) (<= 8 (select (store (store |v_#length_62| |ULTIMATE.start_create_~sll~0#1.base| 16) |ULTIMATE.start_create_~data~0#1.base| 4) |v_ULTIMATE.start_create_~now~0#1.base_27|))) (exists ((|v_#memory_int_39| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_39| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_int_39| |ULTIMATE.start_create_#t~ret8#1.base|) 8 (select (select |#memory_int| |ULTIMATE.start_create_#t~ret8#1.base|) 8))))) (exists ((|v_#valid_73| (Array Int Int))) (and (= (select |v_#valid_73| |ULTIMATE.start_create_~data~0#1.base|) 0) (= (select |v_#valid_73| |ULTIMATE.start_create_~sll~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_56| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_56| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.base_56| |ULTIMATE.start_create_#t~ret8#1.base|) 8 0)))) (exists ((|v_ULTIMATE.start_create_#t~nondet7#1_12| Int)) (and (<= |v_ULTIMATE.start_create_#t~nondet7#1_12| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet7#1_12| 2147483648)) (not (= |v_ULTIMATE.start_create_#t~nondet7#1_12| 0)))) (= |ULTIMATE.start_create_~sll~0#1.base| |v_ULTIMATE.start_create_~now~0#1.base_27|)) (and (exists ((|v_#memory_$Pointer$.base_57| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_57| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.base_57| |ULTIMATE.start_create_#t~ret8#1.base|) 8 0)) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_41| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (<= 0 (+ (select (select |v_#memory_int_41| |ULTIMATE.start_create_~data~0#1.base|) 0) 2147483648)) (= (store |v_#memory_int_40| |ULTIMATE.start_create_~data~0#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_int_41| |ULTIMATE.start_create_~data~0#1.base|) 0))) |v_#memory_int_41|) (= (store |v_#memory_int_41| |v_ULTIMATE.start_create_~now~0#1.base_27| (store (select |v_#memory_int_41| |v_ULTIMATE.start_create_~now~0#1.base_27|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_6| |v_ULTIMATE.start_create_~now~0#1.base_27|) 0))) |v_old(#memory_int)_AFTER_CALL_6|) (<= (select (select |v_#memory_int_41| |ULTIMATE.start_create_~data~0#1.base|) 0) 2147483647) (= (store |v_#memory_int_39| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_39| |ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base|) 8))) |v_#memory_int_40|))) (not (= |ULTIMATE.start_create_~data~0#1.base| 0)) (exists ((|v_#valid_76| (Array Int Int))) (and (= (select |v_#valid_76| |ULTIMATE.start_create_#t~ret8#1.base|) 0) (= (store |v_#valid_76| |ULTIMATE.start_create_#t~ret8#1.base| 1) |#valid|))) (<= (+ |ULTIMATE.start_create_~data~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_43| (Array Int (Array Int Int)))) (= (store |v_#memory_int_43| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_int_43| |ULTIMATE.start_create_#t~ret8#1.base|) 8 (select (select |#memory_int| |ULTIMATE.start_create_#t~ret8#1.base|) 8))) |#memory_int|)) (exists ((|v_#length_60| (Array Int Int))) (<= 8 (select (store (store |v_#length_60| |ULTIMATE.start_create_~sll~0#1.base| 16) |ULTIMATE.start_create_~data~0#1.base| 4) |v_ULTIMATE.start_create_~now~0#1.base_27|))) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (<= (+ |ULTIMATE.start_create_#t~ret8#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_63| (Array Int Int))) (= (store |v_#length_63| |ULTIMATE.start_create_#t~ret8#1.base| 16) |#length|)) (not (= |ULTIMATE.start_create_#t~ret8#1.base| 0)) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_55| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_53| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_53| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |ULTIMATE.start_create_~data~0#1.base| (store (select (store |v_#memory_$Pointer$.base_53| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_53| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_55| |ULTIMATE.start_create_~data~0#1.base|) 0))) |v_#memory_$Pointer$.base_55|)) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_53| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.offset_53| |ULTIMATE.start_create_#t~ret8#1.base|) 8 0)))) (exists ((|v_#memory_$Pointer$.offset_55| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_57| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_55| (store (store |v_#memory_$Pointer$.offset_57| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_57| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |ULTIMATE.start_create_~data~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_57| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_57| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_55| |ULTIMATE.start_create_~data~0#1.base|) 0))))) (exists ((|v_#valid_73| (Array Int Int))) (and (= (select |v_#valid_73| |ULTIMATE.start_create_~data~0#1.base|) 0) (= (select |v_#valid_73| |ULTIMATE.start_create_~sll~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_create_#t~nondet7#1_12| Int)) (and (<= |v_ULTIMATE.start_create_#t~nondet7#1_12| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet7#1_12| 2147483648)) (not (= |v_ULTIMATE.start_create_#t~nondet7#1_12| 0)))) (= |ULTIMATE.start_create_~sll~0#1.base| |v_ULTIMATE.start_create_~now~0#1.base_27|))) (<= (select |#length| |v_ULTIMATE.start_create_~now~0#1.base_27|) 15))) (= |ULTIMATE.start_create_~sll~0#1.offset| 0) (= |ULTIMATE.start_create_~data~0#1.offset| 0) (= |ULTIMATE.start_create_#t~ret8#1.offset| 0))' at error location [2024-11-09 05:03:25,567 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:03:25,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:03:25,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2024-11-09 05:03:25,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759521048] [2024-11-09 05:03:25,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:03:25,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 05:03:25,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:25,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 05:03:25,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=608, Unknown=1, NotChecked=50, Total=756 [2024-11-09 05:03:25,569 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 15 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 05:03:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:26,026 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2024-11-09 05:03:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:03:26,027 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 15 [2024-11-09 05:03:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:26,028 INFO L225 Difference]: With dead ends: 70 [2024-11-09 05:03:26,028 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 05:03:26,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=110, Invalid=705, Unknown=1, NotChecked=54, Total=870 [2024-11-09 05:03:26,029 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 18 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:26,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 261 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 272 Invalid, 0 Unknown, 70 Unchecked, 0.3s Time] [2024-11-09 05:03:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 05:03:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2024-11-09 05:03:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 62 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2024-11-09 05:03:26,035 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 15 [2024-11-09 05:03:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:26,035 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2024-11-09 05:03:26,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 05:03:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2024-11-09 05:03:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:03:26,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:26,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:26,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:03:26,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 05:03:26,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:26,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:26,241 INFO L85 PathProgramCache]: Analyzing trace with hash 298398837, now seen corresponding path program 1 times [2024-11-09 05:03:26,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:26,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914395876] [2024-11-09 05:03:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:26,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:26,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:26,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914395876] [2024-11-09 05:03:26,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914395876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:26,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:26,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:03:26,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667538250] [2024-11-09 05:03:26,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:26,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:03:26,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:26,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:03:26,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:03:26,577 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:26,829 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2024-11-09 05:03:26,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:03:26,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-09 05:03:26,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:26,831 INFO L225 Difference]: With dead ends: 72 [2024-11-09 05:03:26,832 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 05:03:26,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:03:26,833 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:26,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 172 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:03:26,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 05:03:26,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-09 05:03:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.6875) internal successors, (81), 67 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2024-11-09 05:03:26,839 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 15 [2024-11-09 05:03:26,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:26,839 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2024-11-09 05:03:26,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:26,840 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2024-11-09 05:03:26,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:03:26,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:26,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:26,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:03:26,841 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:26,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:26,842 INFO L85 PathProgramCache]: Analyzing trace with hash 298917167, now seen corresponding path program 1 times [2024-11-09 05:03:26,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:26,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140002480] [2024-11-09 05:03:26,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:26,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:26,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:26,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140002480] [2024-11-09 05:03:26,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140002480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:26,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:26,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:03:26,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815543489] [2024-11-09 05:03:26,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:26,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:03:26,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:26,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:03:26,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:03:26,967 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:27,078 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2024-11-09 05:03:27,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:03:27,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-09 05:03:27,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:27,079 INFO L225 Difference]: With dead ends: 76 [2024-11-09 05:03:27,080 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 05:03:27,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:03:27,081 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:27,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 262 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:03:27,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 05:03:27,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-09 05:03:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.58) internal successors, (79), 69 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2024-11-09 05:03:27,086 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 15 [2024-11-09 05:03:27,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:27,087 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2024-11-09 05:03:27,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2024-11-09 05:03:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 05:03:27,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:27,088 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:27,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 05:03:27,088 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:27,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:27,089 INFO L85 PathProgramCache]: Analyzing trace with hash -121099323, now seen corresponding path program 1 times [2024-11-09 05:03:27,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:27,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399912891] [2024-11-09 05:03:27,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:27,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:03:27,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:27,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399912891] [2024-11-09 05:03:27,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399912891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:27,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:27,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:03:27,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698429717] [2024-11-09 05:03:27,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:27,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:03:27,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:27,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:03:27,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:03:27,222 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:03:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:27,364 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2024-11-09 05:03:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:03:27,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-09 05:03:27,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:27,365 INFO L225 Difference]: With dead ends: 73 [2024-11-09 05:03:27,365 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 05:03:27,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:03:27,366 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:27,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 166 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:03:27,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 05:03:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-09 05:03:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.54) internal successors, (77), 68 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2024-11-09 05:03:27,371 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 17 [2024-11-09 05:03:27,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:27,371 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2024-11-09 05:03:27,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:03:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2024-11-09 05:03:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 05:03:27,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:27,372 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:27,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 05:03:27,373 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:27,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:27,373 INFO L85 PathProgramCache]: Analyzing trace with hash -121099322, now seen corresponding path program 1 times [2024-11-09 05:03:27,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:27,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829968359] [2024-11-09 05:03:27,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:27,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:03:27,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:27,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829968359] [2024-11-09 05:03:27,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829968359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:27,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:27,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:03:27,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875667120] [2024-11-09 05:03:27,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:27,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:03:27,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:27,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:03:27,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:03:27,625 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:03:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:27,790 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2024-11-09 05:03:27,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:03:27,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-09 05:03:27,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:27,791 INFO L225 Difference]: With dead ends: 72 [2024-11-09 05:03:27,791 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 05:03:27,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:03:27,792 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:27,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 213 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:03:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 05:03:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-09 05:03:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.5) internal successors, (75), 67 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:27,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2024-11-09 05:03:27,797 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 17 [2024-11-09 05:03:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:27,797 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-11-09 05:03:27,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:03:27,798 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2024-11-09 05:03:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 05:03:27,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:27,799 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:27,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 05:03:27,799 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:27,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash -980799768, now seen corresponding path program 1 times [2024-11-09 05:03:27,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:27,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405825566] [2024-11-09 05:03:27,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:27,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:28,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:28,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405825566] [2024-11-09 05:03:28,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405825566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:03:28,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965311418] [2024-11-09 05:03:28,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:28,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:03:28,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:03:28,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:03:28,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:03:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:28,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 05:03:28,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:03:28,531 INFO L378 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 [2024-11-09 05:03:28,557 INFO L378 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 [2024-11-09 05:03:28,567 INFO L378 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 [2024-11-09 05:03:28,680 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:03:28,680 INFO L378 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 [2024-11-09 05:03:28,728 INFO L378 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 13 [2024-11-09 05:03:28,733 INFO L378 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 13 [2024-11-09 05:03:28,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:03:28,794 INFO L378 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 25 treesize of output 13 [2024-11-09 05:03:28,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:03:28,804 INFO L378 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 25 treesize of output 13 [2024-11-09 05:03:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:28,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:03:29,030 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_364 Int) (v_ArrVal_361 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_361))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_364))) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_363 Int) (v_ArrVal_362 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_362))) (store .cse2 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_363))) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 0)))) is different from false [2024-11-09 05:03:29,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:03:29,247 INFO L378 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 22 treesize of output 23 [2024-11-09 05:03:29,252 INFO L378 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 36 treesize of output 24 [2024-11-09 05:03:29,267 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 05:03:29,268 INFO L378 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 22 treesize of output 1 [2024-11-09 05:03:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965311418] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:03:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1648813579] [2024-11-09 05:03:29,308 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 05:03:29,308 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:03:29,309 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:03:29,309 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:03:29,309 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:03:29,929 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2024-11-09 05:03:29,943 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:03:35,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1648813579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:35,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:03:35,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10, 10, 10] total 33 [2024-11-09 05:03:35,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692623034] [2024-11-09 05:03:35,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:35,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 05:03:35,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:35,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 05:03:35,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=867, Unknown=2, NotChecked=60, Total=1056 [2024-11-09 05:03:35,216 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 13 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:37,706 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2024-11-09 05:03:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:03:37,706 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-09 05:03:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:37,707 INFO L225 Difference]: With dead ends: 79 [2024-11-09 05:03:37,707 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 05:03:37,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=127, Invalid=867, Unknown=2, NotChecked=60, Total=1056 [2024-11-09 05:03:37,708 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:37,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 186 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 05:03:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 05:03:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-11-09 05:03:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.490566037735849) internal successors, (79), 70 states have internal predecessors, (79), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-11-09 05:03:37,713 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 18 [2024-11-09 05:03:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:37,713 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-11-09 05:03:37,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-11-09 05:03:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 05:03:37,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:37,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:37,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 05:03:37,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 05:03:37,916 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:37,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:37,917 INFO L85 PathProgramCache]: Analyzing trace with hash -339501294, now seen corresponding path program 1 times [2024-11-09 05:03:37,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:37,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664858742] [2024-11-09 05:03:37,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:37,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:38,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:38,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664858742] [2024-11-09 05:03:38,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664858742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:03:38,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411361945] [2024-11-09 05:03:38,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:38,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:03:38,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:03:38,008 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:03:38,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:03:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:38,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 05:03:38,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:03:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:38,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:03:38,198 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 05:03:38,198 INFO L378 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 12 treesize of output 11 [2024-11-09 05:03:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:03:38,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411361945] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:03:38,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [202255650] [2024-11-09 05:03:38,225 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 05:03:38,225 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:03:38,225 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:03:38,225 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:03:38,226 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:03:38,813 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2024-11-09 05:03:38,826 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:03:43,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [202255650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:43,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:03:43,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [5, 4, 4] total 18 [2024-11-09 05:03:43,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990905312] [2024-11-09 05:03:43,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:43,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 05:03:43,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:43,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 05:03:43,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-09 05:03:43,393 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:45,867 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2024-11-09 05:03:45,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 05:03:45,868 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-09 05:03:45,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:45,869 INFO L225 Difference]: With dead ends: 85 [2024-11-09 05:03:45,869 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 05:03:45,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-11-09 05:03:45,870 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:45,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 155 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 05:03:45,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 05:03:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2024-11-09 05:03:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 73 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2024-11-09 05:03:45,875 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 19 [2024-11-09 05:03:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:45,875 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-11-09 05:03:45,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:45,876 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2024-11-09 05:03:45,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:03:45,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:45,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:45,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 05:03:46,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 05:03:46,077 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:46,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:46,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1934605475, now seen corresponding path program 1 times [2024-11-09 05:03:46,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:46,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044533082] [2024-11-09 05:03:46,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:46,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:03:46,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:46,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044533082] [2024-11-09 05:03:46,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044533082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:46,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:46,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:03:46,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723119869] [2024-11-09 05:03:46,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:46,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:03:46,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:46,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:03:46,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:03:46,265 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:46,480 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2024-11-09 05:03:46,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:03:46,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-09 05:03:46,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:46,481 INFO L225 Difference]: With dead ends: 88 [2024-11-09 05:03:46,481 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 05:03:46,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:03:46,482 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:46,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 185 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:03:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 05:03:46,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2024-11-09 05:03:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.456140350877193) internal successors, (83), 74 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:46,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2024-11-09 05:03:46,486 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 20 [2024-11-09 05:03:46,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:46,486 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2024-11-09 05:03:46,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:46,486 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2024-11-09 05:03:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 05:03:46,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:46,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:46,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 05:03:46,488 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:46,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:46,488 INFO L85 PathProgramCache]: Analyzing trace with hash 156772530, now seen corresponding path program 1 times [2024-11-09 05:03:46,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:46,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613820054] [2024-11-09 05:03:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:46,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:03:46,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:46,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613820054] [2024-11-09 05:03:46,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613820054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:46,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:46,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:03:46,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436298213] [2024-11-09 05:03:46,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:46,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:03:46,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:46,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:03:46,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:03:46,669 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:46,940 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2024-11-09 05:03:46,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:03:46,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-09 05:03:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:46,942 INFO L225 Difference]: With dead ends: 87 [2024-11-09 05:03:46,942 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 05:03:46,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:03:46,943 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:46,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 147 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:03:46,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 05:03:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2024-11-09 05:03:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 75 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-11-09 05:03:46,947 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 21 [2024-11-09 05:03:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:46,947 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-11-09 05:03:46,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-11-09 05:03:46,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 05:03:46,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:46,948 INFO L215 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] [2024-11-09 05:03:46,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 05:03:46,949 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:46,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:46,949 INFO L85 PathProgramCache]: Analyzing trace with hash 564981247, now seen corresponding path program 1 times [2024-11-09 05:03:46,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:46,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321646967] [2024-11-09 05:03:46,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:46,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:03:47,196 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:47,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321646967] [2024-11-09 05:03:47,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321646967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:03:47,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:03:47,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:03:47,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809754325] [2024-11-09 05:03:47,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:03:47,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:03:47,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:03:47,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:03:47,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:03:47,199 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:03:47,449 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2024-11-09 05:03:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:03:47,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-09 05:03:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:03:47,450 INFO L225 Difference]: With dead ends: 82 [2024-11-09 05:03:47,450 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 05:03:47,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:03:47,451 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 11 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:03:47,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 209 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:03:47,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 05:03:47,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-09 05:03:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 76 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:03:47,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2024-11-09 05:03:47,455 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 22 [2024-11-09 05:03:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:03:47,455 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2024-11-09 05:03:47,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:03:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2024-11-09 05:03:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 05:03:47,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:03:47,456 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:03:47,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 05:03:47,457 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:03:47,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:03:47,457 INFO L85 PathProgramCache]: Analyzing trace with hash -919342166, now seen corresponding path program 1 times [2024-11-09 05:03:47,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:03:47,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607971146] [2024-11-09 05:03:47,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:47,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:03:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:47,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:03:47,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:03:47,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607971146] [2024-11-09 05:03:47,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607971146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:03:47,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287087191] [2024-11-09 05:03:47,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:03:47,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:03:47,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:03:47,956 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:03:47,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:03:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:03:48,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 05:03:48,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:03:48,135 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:03:48,135 INFO L378 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 [2024-11-09 05:03:48,163 INFO L378 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 19 treesize of output 1 [2024-11-09 05:03:48,229 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:03:48,231 INFO L378 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 42 treesize of output 41 [2024-11-09 05:03:48,243 INFO L378 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 31 treesize of output 13 [2024-11-09 05:03:48,256 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-09 05:03:48,283 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 05:03:48,283 INFO L378 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 19 treesize of output 16 [2024-11-09 05:03:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2024-11-09 05:03:48,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:03:48,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287087191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:03:48,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1053146601] [2024-11-09 05:03:48,342 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 05:03:48,342 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:03:48,342 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:03:48,343 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:03:48,343 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:03:55,208 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 1 for LOIs [2024-11-09 05:03:55,220 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:04:13,121 WARN L286 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 283 DAG size of output: 264 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:04:38,365 WARN L286 SmtUtils]: Spent 15.58s on a formula simplification. DAG size of input: 308 DAG size of output: 289 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:04:40,395 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3299#(and (exists ((|v_ULTIMATE.start_create_~now~0#1.base_36| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_~now~0#1.base_36|) 1))) (= |ULTIMATE.start_create_#t~ret8#1.offset| 0))' at error location [2024-11-09 05:04:40,395 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:04:40,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:04:40,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2024-11-09 05:04:40,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398868966] [2024-11-09 05:04:40,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:04:40,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 05:04:40,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:04:40,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 05:04:40,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=733, Unknown=5, NotChecked=54, Total=870 [2024-11-09 05:04:40,398 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 05:04:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:04:41,594 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2024-11-09 05:04:41,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:04:41,595 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 25 [2024-11-09 05:04:41,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:04:41,596 INFO L225 Difference]: With dead ends: 81 [2024-11-09 05:04:41,596 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 05:04:41,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 45.9s TimeCoverageRelationStatistics Valid=111, Invalid=1010, Unknown=5, NotChecked=64, Total=1190 [2024-11-09 05:04:41,597 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 5 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:04:41,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 396 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 55 Unchecked, 0.7s Time] [2024-11-09 05:04:41,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 05:04:41,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 05:04:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.423728813559322) internal successors, (84), 75 states have internal predecessors, (84), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:04:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-11-09 05:04:41,602 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 25 [2024-11-09 05:04:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:04:41,602 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-11-09 05:04:41,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 05:04:41,603 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-11-09 05:04:41,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 05:04:41,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:04:41,604 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:04:41,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 05:04:41,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:04:41,808 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:04:41,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:04:41,809 INFO L85 PathProgramCache]: Analyzing trace with hash -919342165, now seen corresponding path program 1 times [2024-11-09 05:04:41,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:04:41,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444942767] [2024-11-09 05:04:41,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:41,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:04:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:04:43,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:04:43,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444942767] [2024-11-09 05:04:43,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444942767] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:04:43,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147854840] [2024-11-09 05:04:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:04:43,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:04:43,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:04:43,078 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:04:43,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 05:04:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:04:43,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 05:04:43,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:04:43,268 INFO L378 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 8 treesize of output 1 [2024-11-09 05:04:43,439 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:04:43,440 INFO L378 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 [2024-11-09 05:04:43,541 INFO L378 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 19 treesize of output 1 [2024-11-09 05:04:43,547 INFO L378 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 [2024-11-09 05:04:43,750 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:04:43,750 INFO L378 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 73 treesize of output 66 [2024-11-09 05:04:43,767 INFO L378 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 13 [2024-11-09 05:04:43,893 INFO L378 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 42 treesize of output 18 [2024-11-09 05:04:43,918 INFO L378 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 9 treesize of output 3 [2024-11-09 05:04:44,124 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-09 05:04:44,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:04:44,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 05:04:44,198 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:04:44,199 INFO L378 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 [2024-11-09 05:04:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 05:04:44,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:04:44,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147854840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:04:44,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [556478267] [2024-11-09 05:04:44,668 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 05:04:44,668 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:04:44,669 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:04:44,669 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:04:44,669 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:04:51,567 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 1 for LOIs [2024-11-09 05:04:51,578 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:05:02,587 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 291 DAG size of output: 272 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:05:34,784 WARN L286 SmtUtils]: Spent 7.51s on a formula simplification. DAG size of input: 283 DAG size of output: 264 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:06:04,759 WARN L286 SmtUtils]: Spent 17.20s on a formula simplification. DAG size of input: 308 DAG size of output: 289 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:06:07,908 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3587#(and (exists ((|v_ULTIMATE.start_create_~now~0#1.offset_35| Int) (|v_ULTIMATE.start_create_~now~0#1.base_40| Int)) (and (or (< (select |#length| |v_ULTIMATE.start_create_~now~0#1.base_40|) (+ 16 |v_ULTIMATE.start_create_~now~0#1.offset_35|)) (< (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_35|) 0)) (or (and (exists ((|v_#length_97| (Array Int Int))) (= (store |v_#length_97| |ULTIMATE.start_create_#t~ret8#1.base| 16) |#length|)) (exists ((|v_#memory_int_82| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_82| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_int_82| |ULTIMATE.start_create_#t~ret8#1.base|) 8 (select (select |#memory_int| |ULTIMATE.start_create_#t~ret8#1.base|) 8))))) (<= (+ |ULTIMATE.start_create_#t~ret8#1.base| 1) |#StackHeapBarrier|) (exists ((|v_old(#length)_AFTER_CALL_33| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_33| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_33| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_#t~nondet7#1_23| Int) (|v_old(#memory_int)_AFTER_CALL_33| (Array Int (Array Int Int)))) (and (not (= |v_ULTIMATE.start_create_#t~nondet7#1_23| 0)) (<= |v_ULTIMATE.start_create_#t~nondet7#1_23| 2147483647) (or (and (not (= |ULTIMATE.start_create_~data~0#1.base| 0)) (<= (+ |ULTIMATE.start_create_~data~0#1.base| 1) |#StackHeapBarrier|) (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_105| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_33| (store |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_~now~0#1.base_40| (store (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_~now~0#1.base_40|) 0 |ULTIMATE.start_create_~data~0#1.base|))) (= (store (store |v_#memory_$Pointer$.base_105| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_105| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |ULTIMATE.start_create_~data~0#1.base| (store (select (store |v_#memory_$Pointer$.base_105| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_105| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_107| |ULTIMATE.start_create_~data~0#1.base|) 0))) |v_#memory_$Pointer$.base_107|))) (<= 8 (select |v_old(#length)_AFTER_CALL_33| |v_ULTIMATE.start_create_~now~0#1.base_40|)) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_97| (Array Int Int))) (= (store (store |v_#length_97| |ULTIMATE.start_create_~sll~0#1.base| 16) |ULTIMATE.start_create_~data~0#1.base| 4) |v_old(#length)_AFTER_CALL_33|)) (exists ((|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_103| (Array Int (Array Int Int)))) (and (= (store (store |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |ULTIMATE.start_create_~data~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_105| |ULTIMATE.start_create_~data~0#1.base|) 0))) |v_#memory_$Pointer$.offset_105|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_33| (store |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_create_~now~0#1.base_40| (store (select |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_create_~now~0#1.base_40|) 0 0))))) (= |ULTIMATE.start_create_~sll~0#1.offset| 0) (= |v_ULTIMATE.start_create_~now~0#1.offset_35| 0) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (<= (select (select |v_#memory_int_84| |ULTIMATE.start_create_~data~0#1.base|) 0) 2147483647) (= |v_#memory_int_84| (store |v_#memory_int_83| |ULTIMATE.start_create_~data~0#1.base| (store (select |v_#memory_int_83| |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_int_84| |ULTIMATE.start_create_~data~0#1.base|) 0)))) (= |v_old(#memory_int)_AFTER_CALL_33| (store |v_#memory_int_84| |v_ULTIMATE.start_create_~now~0#1.base_40| (store (select |v_#memory_int_84| |v_ULTIMATE.start_create_~now~0#1.base_40|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_33| |v_ULTIMATE.start_create_~now~0#1.base_40|) 0)))) (= (store |v_#memory_int_82| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_82| |ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |v_#memory_int_83| |ULTIMATE.start_create_~sll~0#1.base|) 8))) |v_#memory_int_83|) (<= 0 (+ (select (select |v_#memory_int_84| |ULTIMATE.start_create_~data~0#1.base|) 0) 2147483648)))) (exists ((|v_#valid_116| (Array Int Int))) (and (= 0 (select |v_#valid_116| |ULTIMATE.start_create_~sll~0#1.base|)) (= |v_old(#valid)_AFTER_CALL_33| (store (store |v_#valid_116| |ULTIMATE.start_create_~sll~0#1.base| 1) |ULTIMATE.start_create_~data~0#1.base| 1)) (= (select |v_#valid_116| |ULTIMATE.start_create_~data~0#1.base|) 0))) (= |ULTIMATE.start_create_~sll~0#1.base| |v_ULTIMATE.start_create_~now~0#1.base_40|) (= |ULTIMATE.start_create_~data~0#1.offset| 0)) (and (exists ((|v_ULTIMATE.start_create_~now~0#1.offset_34| Int) (|v_ULTIMATE.start_create_~now~0#1.base_39| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_create_~now~0#1.base_39|) 1) (<= (+ 16 |v_ULTIMATE.start_create_~now~0#1.offset_34|) (select |v_old(#length)_AFTER_CALL_33| |v_ULTIMATE.start_create_~now~0#1.base_39|)) (<= 0 (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_34|)) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_33| |v_ULTIMATE.start_create_~now~0#1.base_39|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_34|)) |v_ULTIMATE.start_create_~now~0#1.base_40|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_33| |v_ULTIMATE.start_create_~now~0#1.base_39|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_34|)) |v_ULTIMATE.start_create_~now~0#1.offset_35|))) (exists ((|v_ULTIMATE.start_create_#t~mem9#1.base_23| Int) (|v_#memory_int_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_113| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_111| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_#t~mem9#1.offset_20| Int)) (and (= |v_old(#memory_int)_AFTER_CALL_33| (store |v_#memory_int_90| |v_ULTIMATE.start_create_#t~mem9#1.base_23| (store (select |v_#memory_int_90| |v_ULTIMATE.start_create_#t~mem9#1.base_23|) |v_ULTIMATE.start_create_#t~mem9#1.offset_20| (select (select |v_old(#memory_int)_AFTER_CALL_33| |v_ULTIMATE.start_create_#t~mem9#1.base_23|) |v_ULTIMATE.start_create_#t~mem9#1.offset_20|)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_33| (store |v_#memory_$Pointer$.offset_111| |v_ULTIMATE.start_create_#t~mem9#1.base_23| (store (select |v_#memory_$Pointer$.offset_111| |v_ULTIMATE.start_create_#t~mem9#1.base_23|) |v_ULTIMATE.start_create_#t~mem9#1.offset_20| |ULTIMATE.start_create_~data~0#1.offset|))) (= (store |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_create_#t~mem9#1.base_23| (store (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_create_#t~mem9#1.base_23|) |v_ULTIMATE.start_create_#t~mem9#1.offset_20| |ULTIMATE.start_create_~data~0#1.base|)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_33|) (<= (+ 8 |v_ULTIMATE.start_create_#t~mem9#1.offset_20|) (select |v_old(#length)_AFTER_CALL_33| |v_ULTIMATE.start_create_#t~mem9#1.base_23|)) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_create_#t~mem9#1.base_23|) 1) (<= 0 |v_ULTIMATE.start_create_#t~mem9#1.offset_20|))))) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet7#1_23| 2147483648)))) (exists ((|v_#valid_116| (Array Int Int))) (and (= (select |v_#valid_116| |ULTIMATE.start_create_#t~ret8#1.base|) 0) (= (store |v_#valid_116| |ULTIMATE.start_create_#t~ret8#1.base| 1) |#valid|))) (not (= |ULTIMATE.start_create_#t~ret8#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_103| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_create_#t~ret8#1.base|) 8 0)))) (exists ((|v_#memory_$Pointer$.base_105| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_105| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.base_105| |ULTIMATE.start_create_#t~ret8#1.base|) 8 0))))) (and (exists ((|v_#length_97| (Array Int Int))) (= (store |v_#length_97| |ULTIMATE.start_create_#t~ret8#1.base| 16) |#length|)) (exists ((|v_#memory_int_82| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_82| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_int_82| |ULTIMATE.start_create_#t~ret8#1.base|) 8 (select (select |#memory_int| |ULTIMATE.start_create_#t~ret8#1.base|) 8))))) (<= (+ |ULTIMATE.start_create_#t~ret8#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_116| (Array Int Int))) (and (= (select |v_#valid_116| |ULTIMATE.start_create_#t~ret8#1.base|) 0) (= (store |v_#valid_116| |ULTIMATE.start_create_#t~ret8#1.base| 1) |#valid|))) (not (= |ULTIMATE.start_create_#t~ret8#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_103| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_create_#t~ret8#1.base|) 8 0)))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_34| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_34| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (|v_ULTIMATE.start_create_#t~nondet7#1_23| Int) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_34| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_34| (Array Int (Array Int Int)))) (and (not (= |v_ULTIMATE.start_create_#t~nondet7#1_23| 0)) (or (and (not (= |ULTIMATE.start_create_~data~0#1.base| 0)) (<= (+ |ULTIMATE.start_create_~data~0#1.base| 1) |#StackHeapBarrier|) (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (<= 8 (select |v_old(#length)_AFTER_CALL_34| |v_ULTIMATE.start_create_~now~0#1.base_40|)) (exists ((|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_103| (Array Int (Array Int Int)))) (and (= (store (store |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |ULTIMATE.start_create_~data~0#1.base| (store (select (store |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_105| |ULTIMATE.start_create_~data~0#1.base|) 0))) |v_#memory_$Pointer$.offset_105|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_34| (store |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_create_~now~0#1.base_40| (store (select |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_create_~now~0#1.base_40|) 0 0))))) (exists ((|v_#valid_116| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_34| (store (store |v_#valid_116| |ULTIMATE.start_create_~sll~0#1.base| 1) |ULTIMATE.start_create_~data~0#1.base| 1)) (= 0 (select |v_#valid_116| |ULTIMATE.start_create_~sll~0#1.base|)) (= (select |v_#valid_116| |ULTIMATE.start_create_~data~0#1.base|) 0))) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_97| (Array Int Int))) (= (store (store |v_#length_97| |ULTIMATE.start_create_~sll~0#1.base| 16) |ULTIMATE.start_create_~data~0#1.base| 4) |v_old(#length)_AFTER_CALL_34|)) (= |ULTIMATE.start_create_~sll~0#1.offset| 0) (= |v_ULTIMATE.start_create_~now~0#1.offset_35| 0) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (= |ULTIMATE.start_create_~sll~0#1.base| |v_ULTIMATE.start_create_~now~0#1.base_40|) (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (<= (select (select |v_#memory_int_84| |ULTIMATE.start_create_~data~0#1.base|) 0) 2147483647) (= |v_#memory_int_84| (store |v_#memory_int_83| |ULTIMATE.start_create_~data~0#1.base| (store (select |v_#memory_int_83| |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_int_84| |ULTIMATE.start_create_~data~0#1.base|) 0)))) (= (store |v_#memory_int_82| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_82| |ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |v_#memory_int_83| |ULTIMATE.start_create_~sll~0#1.base|) 8))) |v_#memory_int_83|) (= |v_old(#memory_int)_AFTER_CALL_34| (store |v_#memory_int_84| |v_ULTIMATE.start_create_~now~0#1.base_40| (store (select |v_#memory_int_84| |v_ULTIMATE.start_create_~now~0#1.base_40|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_34| |v_ULTIMATE.start_create_~now~0#1.base_40|) 0)))) (<= 0 (+ (select (select |v_#memory_int_84| |ULTIMATE.start_create_~data~0#1.base|) 0) 2147483648)))) (exists ((|v_#memory_$Pointer$.base_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_105| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| (store |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_~now~0#1.base_40| (store (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_create_~now~0#1.base_40|) 0 |ULTIMATE.start_create_~data~0#1.base|))) (= (store (store |v_#memory_$Pointer$.base_105| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_105| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |ULTIMATE.start_create_~data~0#1.base| (store (select (store |v_#memory_$Pointer$.base_105| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_105| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |ULTIMATE.start_create_~data~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_107| |ULTIMATE.start_create_~data~0#1.base|) 0))) |v_#memory_$Pointer$.base_107|))) (= |ULTIMATE.start_create_~data~0#1.offset| 0)) (and (exists ((|v_ULTIMATE.start_create_#t~mem9#1.base_23| Int) (|v_#memory_int_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_113| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_111| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_#t~mem9#1.offset_20| Int)) (and (= |v_old(#memory_int)_AFTER_CALL_34| (store |v_#memory_int_90| |v_ULTIMATE.start_create_#t~mem9#1.base_23| (store (select |v_#memory_int_90| |v_ULTIMATE.start_create_#t~mem9#1.base_23|) |v_ULTIMATE.start_create_#t~mem9#1.offset_20| (select (select |v_old(#memory_int)_AFTER_CALL_34| |v_ULTIMATE.start_create_#t~mem9#1.base_23|) |v_ULTIMATE.start_create_#t~mem9#1.offset_20|)))) (<= (+ 8 |v_ULTIMATE.start_create_#t~mem9#1.offset_20|) (select |v_old(#length)_AFTER_CALL_34| |v_ULTIMATE.start_create_#t~mem9#1.base_23|)) (= (store |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_create_#t~mem9#1.base_23| (store (select |v_#memory_$Pointer$.base_113| |v_ULTIMATE.start_create_#t~mem9#1.base_23|) |v_ULTIMATE.start_create_#t~mem9#1.offset_20| |ULTIMATE.start_create_~data~0#1.base|)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_34| |v_ULTIMATE.start_create_#t~mem9#1.base_23|) 1) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_34| (store |v_#memory_$Pointer$.offset_111| |v_ULTIMATE.start_create_#t~mem9#1.base_23| (store (select |v_#memory_$Pointer$.offset_111| |v_ULTIMATE.start_create_#t~mem9#1.base_23|) |v_ULTIMATE.start_create_#t~mem9#1.offset_20| |ULTIMATE.start_create_~data~0#1.offset|))) (<= 0 |v_ULTIMATE.start_create_#t~mem9#1.offset_20|))) (exists ((|v_ULTIMATE.start_create_~now~0#1.offset_34| Int) (|v_ULTIMATE.start_create_~now~0#1.base_39| Int)) (and (<= (+ 16 |v_ULTIMATE.start_create_~now~0#1.offset_34|) (select |v_old(#length)_AFTER_CALL_34| |v_ULTIMATE.start_create_~now~0#1.base_39|)) (<= 0 (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_34|)) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |v_ULTIMATE.start_create_~now~0#1.base_39|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_34|)) |v_ULTIMATE.start_create_~now~0#1.base_40|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_34| |v_ULTIMATE.start_create_~now~0#1.base_39|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_34|)) |v_ULTIMATE.start_create_~now~0#1.offset_35|) (= (select |v_old(#valid)_AFTER_CALL_34| |v_ULTIMATE.start_create_~now~0#1.base_39|) 1))))) (<= |v_ULTIMATE.start_create_#t~nondet7#1_23| 2147483647) (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet7#1_23| 2147483648)))) (exists ((|v_#memory_$Pointer$.base_105| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_105| |ULTIMATE.start_create_#t~ret8#1.base| (store (select |v_#memory_$Pointer$.base_105| |ULTIMATE.start_create_#t~ret8#1.base|) 8 0)))))))) (= |ULTIMATE.start_create_#t~ret8#1.offset| 0))' at error location [2024-11-09 05:06:07,908 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:06:07,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:06:07,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 23 [2024-11-09 05:06:07,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475140059] [2024-11-09 05:06:07,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:06:07,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 05:06:07,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:06:07,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 05:06:07,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1278, Unknown=8, NotChecked=72, Total=1482 [2024-11-09 05:06:07,911 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 24 states, 20 states have (on average 1.5) internal successors, (30), 18 states have internal predecessors, (30), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 05:06:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:06:13,296 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2024-11-09 05:06:13,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:06:13,296 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 1.5) internal successors, (30), 18 states have internal predecessors, (30), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 25 [2024-11-09 05:06:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:06:13,297 INFO L225 Difference]: With dead ends: 78 [2024-11-09 05:06:13,297 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 05:06:13,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 81.8s TimeCoverageRelationStatistics Valid=191, Invalid=1778, Unknown=15, NotChecked=86, Total=2070 [2024-11-09 05:06:13,299 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:06:13,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 540 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 476 Invalid, 0 Unknown, 62 Unchecked, 1.4s Time] [2024-11-09 05:06:13,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 05:06:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 05:06:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 72 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:06:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-11-09 05:06:13,304 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 25 [2024-11-09 05:06:13,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:06:13,304 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-11-09 05:06:13,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 1.5) internal successors, (30), 18 states have internal predecessors, (30), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 05:06:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-11-09 05:06:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 05:06:13,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:06:13,306 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:06:13,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 05:06:13,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:06:13,507 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:06:13,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:06:13,508 INFO L85 PathProgramCache]: Analyzing trace with hash -964950910, now seen corresponding path program 1 times [2024-11-09 05:06:13,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:06:13,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456637018] [2024-11-09 05:06:13,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:06:13,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:06:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:06:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:06:14,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:06:14,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456637018] [2024-11-09 05:06:14,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456637018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:06:14,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844826813] [2024-11-09 05:06:14,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:06:14,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:06:14,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:06:14,064 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:06:14,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 05:06:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:06:14,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 05:06:14,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:06:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 05:06:14,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:06:14,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:06:14,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-09 05:06:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 05:06:15,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844826813] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:06:15,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [953180381] [2024-11-09 05:06:15,208 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 05:06:15,209 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:06:15,209 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:06:15,209 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:06:15,209 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:06:21,727 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 1 for LOIs [2024-11-09 05:06:21,744 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:06:44,109 WARN L286 SmtUtils]: Spent 7.57s on a formula simplification. DAG size of input: 283 DAG size of output: 264 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:07:10,438 WARN L286 SmtUtils]: Spent 16.81s on a formula simplification. DAG size of input: 308 DAG size of output: 289 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:07:24,744 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3931#(and (= (select |#valid| |ULTIMATE.start_main_~l~0#1.base|) 1) (<= (+ |ULTIMATE.start_main_~l~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~l~0#1.base|)) (<= 0 |ULTIMATE.start_main_~l~0#1.offset|) (<= (select |#length| |ULTIMATE.start_main_~l~0#1.base|) (+ |ULTIMATE.start_main_~l~0#1.offset| 15)) (exists ((|v_ULTIMATE.start_create_~now~0#1.base_45| Int)) (and (<= 8 (select |#length| |v_ULTIMATE.start_create_~now~0#1.base_45|)) (= (select |#valid| |v_ULTIMATE.start_create_~now~0#1.base_45|) 1))) (exists ((|v_ULTIMATE.start_create_#t~mem9#1.base_27| Int) (|v_ULTIMATE.start_create_#t~mem9#1.offset_24| Int) (|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_112| |v_ULTIMATE.start_create_#t~mem9#1.base_27| (store (select |v_#memory_int_112| |v_ULTIMATE.start_create_#t~mem9#1.base_27|) |v_ULTIMATE.start_create_#t~mem9#1.offset_24| (select (select |#memory_int| |v_ULTIMATE.start_create_#t~mem9#1.base_27|) |v_ULTIMATE.start_create_#t~mem9#1.offset_24|)))) (<= 0 |v_ULTIMATE.start_create_#t~mem9#1.offset_24|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_create_#t~mem9#1.base_27| (store (select |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_create_#t~mem9#1.base_27|) |v_ULTIMATE.start_create_#t~mem9#1.offset_24| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_create_#t~mem9#1.base_27|) |v_ULTIMATE.start_create_#t~mem9#1.offset_24|)))) (= (select |#valid| |v_ULTIMATE.start_create_#t~mem9#1.base_27|) 1) (<= (+ 8 |v_ULTIMATE.start_create_#t~mem9#1.offset_24|) (select |#length| |v_ULTIMATE.start_create_#t~mem9#1.base_27|)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_create_#t~mem9#1.base_27| (store (select |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_create_#t~mem9#1.base_27|) |v_ULTIMATE.start_create_#t~mem9#1.offset_24| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_create_#t~mem9#1.base_27|) |v_ULTIMATE.start_create_#t~mem9#1.offset_24|)))))) (or (not (= |ULTIMATE.start_main_~l~0#1.base| 0)) (not (= |ULTIMATE.start_main_~l~0#1.offset| 0))))' at error location [2024-11-09 05:07:24,744 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:07:24,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:07:24,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 16 [2024-11-09 05:07:24,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258273305] [2024-11-09 05:07:24,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:07:24,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 05:07:24,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:07:24,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 05:07:24,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=940, Unknown=6, NotChecked=0, Total=1056 [2024-11-09 05:07:24,747 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 05:07:25,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:07:25,416 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2024-11-09 05:07:25,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:07:25,417 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 25 [2024-11-09 05:07:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:07:25,418 INFO L225 Difference]: With dead ends: 80 [2024-11-09 05:07:25,418 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 05:07:25,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 63.8s TimeCoverageRelationStatistics Valid=110, Invalid=940, Unknown=6, NotChecked=0, Total=1056 [2024-11-09 05:07:25,420 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:07:25,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 435 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 05:07:25,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 05:07:25,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-11-09 05:07:25,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 73 states have internal predecessors, (82), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:07:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2024-11-09 05:07:25,425 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 25 [2024-11-09 05:07:25,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:07:25,425 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-11-09 05:07:25,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 05:07:25,426 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2024-11-09 05:07:25,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 05:07:25,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:07:25,427 INFO L215 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] [2024-11-09 05:07:25,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 05:07:25,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:07:25,631 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:07:25,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:07:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash -620385317, now seen corresponding path program 1 times [2024-11-09 05:07:25,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:07:25,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621683955] [2024-11-09 05:07:25,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:07:25,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:07:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:07:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:07:26,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:07:26,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621683955] [2024-11-09 05:07:26,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621683955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:07:26,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:07:26,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 05:07:26,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246432981] [2024-11-09 05:07:26,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:07:26,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 05:07:26,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:07:26,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 05:07:26,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:07:26,264 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 10 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:07:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:07:27,142 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2024-11-09 05:07:27,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 05:07:27,143 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-09 05:07:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:07:27,143 INFO L225 Difference]: With dead ends: 82 [2024-11-09 05:07:27,143 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 05:07:27,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-09 05:07:27,144 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:07:27,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 138 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 05:07:27,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 05:07:27,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2024-11-09 05:07:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.380952380952381) internal successors, (87), 75 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:07:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2024-11-09 05:07:27,149 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 25 [2024-11-09 05:07:27,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:07:27,150 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2024-11-09 05:07:27,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:07:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2024-11-09 05:07:27,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 05:07:27,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:07:27,151 INFO L215 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] [2024-11-09 05:07:27,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 05:07:27,151 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:07:27,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:07:27,152 INFO L85 PathProgramCache]: Analyzing trace with hash -620385316, now seen corresponding path program 1 times [2024-11-09 05:07:27,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:07:27,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812490338] [2024-11-09 05:07:27,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:07:27,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:07:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:07:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:07:27,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:07:27,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812490338] [2024-11-09 05:07:27,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812490338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:07:27,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983984693] [2024-11-09 05:07:27,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:07:27,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:07:27,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:07:27,638 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:07:27,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 05:07:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:07:27,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 05:07:27,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:07:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:07:28,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:07:28,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:07:28,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-09 05:07:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:07:28,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983984693] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:07:28,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [247516407] [2024-11-09 05:07:28,885 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 05:07:28,885 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:07:28,886 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:07:28,886 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:07:28,886 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:07:29,557 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2024-11-09 05:07:29,569 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:07:42,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [247516407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:07:42,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:07:42,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [8, 5, 5] total 32 [2024-11-09 05:07:42,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449107995] [2024-11-09 05:07:42,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:07:42,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 05:07:42,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:07:42,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 05:07:42,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=928, Unknown=1, NotChecked=0, Total=1056 [2024-11-09 05:07:42,871 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 18 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:07:46,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:07:46,985 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2024-11-09 05:07:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 05:07:46,986 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-09 05:07:46,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:07:46,987 INFO L225 Difference]: With dead ends: 82 [2024-11-09 05:07:46,987 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 05:07:46,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=127, Invalid=928, Unknown=1, NotChecked=0, Total=1056 [2024-11-09 05:07:46,988 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:07:46,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 112 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 05:07:46,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 05:07:46,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-09 05:07:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.328125) internal successors, (85), 76 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:07:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2024-11-09 05:07:46,994 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 25 [2024-11-09 05:07:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:07:46,994 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2024-11-09 05:07:46,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:07:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2024-11-09 05:07:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 05:07:46,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:07:46,996 INFO L215 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] [2024-11-09 05:07:47,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 05:07:47,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:07:47,198 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:07:47,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:07:47,198 INFO L85 PathProgramCache]: Analyzing trace with hash 810191733, now seen corresponding path program 1 times [2024-11-09 05:07:47,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:07:47,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273125323] [2024-11-09 05:07:47,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:07:47,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:07:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:07:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:07:47,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:07:47,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273125323] [2024-11-09 05:07:47,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273125323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:07:47,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:07:47,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:07:47,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697818125] [2024-11-09 05:07:47,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:07:47,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:07:47,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:07:47,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:07:47,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:07:47,494 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:07:48,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:07:48,225 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2024-11-09 05:07:48,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:07:48,226 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-09 05:07:48,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:07:48,227 INFO L225 Difference]: With dead ends: 88 [2024-11-09 05:07:48,227 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 05:07:48,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:07:48,228 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 15 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:07:48,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 164 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 05:07:48,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 05:07:48,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-11-09 05:07:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 81 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:07:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2024-11-09 05:07:48,232 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 27 [2024-11-09 05:07:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:07:48,233 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2024-11-09 05:07:48,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:07:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2024-11-09 05:07:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 05:07:48,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:07:48,234 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:07:48,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 05:07:48,234 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:07:48,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:07:48,235 INFO L85 PathProgramCache]: Analyzing trace with hash -634697797, now seen corresponding path program 1 times [2024-11-09 05:07:48,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:07:48,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448339602] [2024-11-09 05:07:48,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:07:48,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:07:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:07:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:07:50,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:07:50,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448339602] [2024-11-09 05:07:50,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448339602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:07:50,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392835114] [2024-11-09 05:07:50,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:07:50,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:07:50,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:07:50,075 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:07:50,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 05:07:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:07:50,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 05:07:50,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:07:50,824 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 05:07:50,824 INFO L378 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 [2024-11-09 05:07:51,089 INFO L378 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 19 treesize of output 1 [2024-11-09 05:07:51,449 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:07:51,449 INFO L378 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 42 treesize of output 41 [2024-11-09 05:07:51,929 INFO L378 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 31 treesize of output 13 [2024-11-09 05:07:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:07:52,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:07:52,775 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_961 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_961) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) 1)) is different from false [2024-11-09 05:07:52,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:07:52,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-09 05:07:52,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:07:52,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2024-11-09 05:07:52,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-09 05:07:53,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392835114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:07:53,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [201140318] [2024-11-09 05:07:53,789 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 05:07:53,790 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:07:53,790 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:07:53,790 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:07:53,791 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:08:00,335 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 1 for LOIs [2024-11-09 05:08:00,347 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:08:43,395 WARN L286 SmtUtils]: Spent 7.63s on a formula simplification. DAG size of input: 283 DAG size of output: 264 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:09:12,444 WARN L286 SmtUtils]: Spent 17.72s on a formula simplification. DAG size of input: 308 DAG size of output: 289 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:09:18,800 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4966#(exists ((|v_ULTIMATE.start_loop_~x#1.base_50| Int)) (and (or (not (= |v_ULTIMATE.start_loop_~x#1.base_50| 0)) (not (= |ULTIMATE.start_loop_~x#1.offset| 0))) (not (= (select |#valid| |v_ULTIMATE.start_loop_~x#1.base_50|) 1))))' at error location [2024-11-09 05:09:18,800 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:09:18,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:09:18,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2024-11-09 05:09:18,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670016259] [2024-11-09 05:09:18,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:09:18,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 05:09:18,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:09:18,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 05:09:18,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1890, Unknown=29, NotChecked=88, Total=2162 [2024-11-09 05:09:18,803 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 27 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 05:09:25,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:09:25,461 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2024-11-09 05:09:25,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 05:09:25,461 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-11-09 05:09:25,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:09:25,462 INFO L225 Difference]: With dead ends: 94 [2024-11-09 05:09:25,462 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 05:09:25,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 86.8s TimeCoverageRelationStatistics Valid=219, Invalid=2507, Unknown=34, NotChecked=102, Total=2862 [2024-11-09 05:09:25,464 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 14 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:09:25,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 425 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 05:09:25,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 05:09:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-11-09 05:09:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 84 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:09:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2024-11-09 05:09:25,468 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 28 [2024-11-09 05:09:25,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:09:25,468 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2024-11-09 05:09:25,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 05:09:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2024-11-09 05:09:25,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 05:09:25,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:09:25,469 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:09:25,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 05:09:25,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 05:09:25,670 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:09:25,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:09:25,671 INFO L85 PathProgramCache]: Analyzing trace with hash -634697796, now seen corresponding path program 1 times [2024-11-09 05:09:25,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:09:25,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043061973] [2024-11-09 05:09:25,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:09:25,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:09:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:09:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:09:27,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:09:27,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043061973] [2024-11-09 05:09:27,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043061973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:09:27,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356850659] [2024-11-09 05:09:27,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:09:27,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:09:27,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:09:27,541 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:09:27,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 05:09:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:09:27,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 05:09:27,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:09:27,997 INFO L378 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 8 treesize of output 1 [2024-11-09 05:09:28,071 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:09:28,072 INFO L378 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 [2024-11-09 05:09:28,223 INFO L378 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 [2024-11-09 05:09:28,239 INFO L378 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 19 treesize of output 1 [2024-11-09 05:09:28,535 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 05:09:28,536 INFO L378 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 62 treesize of output 57 [2024-11-09 05:09:28,552 INFO L378 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 13 [2024-11-09 05:09:28,938 INFO L378 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 31 treesize of output 13 [2024-11-09 05:09:28,948 INFO L378 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 9 treesize of output 3 [2024-11-09 05:09:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:09:28,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:09:29,484 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_1052 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1052) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0))) (forall ((v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1052 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1052) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1053) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0)))))) is different from false [2024-11-09 05:09:29,510 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1052 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1052) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1053) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))) (forall ((v_ArrVal_1052 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1052) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))))) is different from false [2024-11-09 05:09:29,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:09:29,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-09 05:09:29,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:09:29,547 INFO L378 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 35 treesize of output 36 [2024-11-09 05:09:29,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:09:29,581 INFO L378 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 62 treesize of output 61 [2024-11-09 05:09:29,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:09:29,631 INFO L378 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 96 treesize of output 89 [2024-11-09 05:09:29,696 INFO L378 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 11 [2024-11-09 05:09:29,704 INFO L378 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 [2024-11-09 05:09:29,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:09:29,722 INFO L378 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 22 treesize of output 23 [2024-11-09 05:09:29,729 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:09:29,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:09:29,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 05:09:30,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356850659] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:09:30,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [105626462] [2024-11-09 05:09:30,207 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 05:09:30,207 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:09:30,207 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:09:30,208 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:09:30,208 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:09:36,666 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 1 for LOIs [2024-11-09 05:09:36,676 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:09:56,481 WARN L286 SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 283 DAG size of output: 264 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:10:23,295 WARN L286 SmtUtils]: Spent 17.57s on a formula simplification. DAG size of input: 308 DAG size of output: 289 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:10:26,251 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5178#true' at error location [2024-11-09 05:10:26,251 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:10:26,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:10:26,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 23 [2024-11-09 05:10:26,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470920261] [2024-11-09 05:10:26,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:10:26,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 05:10:26,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:10:26,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 05:10:26,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1663, Unknown=3, NotChecked=166, Total=1980 [2024-11-09 05:10:26,255 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 24 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 05:10:28,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:10:28,396 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2024-11-09 05:10:28,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 05:10:28,397 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-11-09 05:10:28,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:10:28,397 INFO L225 Difference]: With dead ends: 92 [2024-11-09 05:10:28,398 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 05:10:28,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 52.6s TimeCoverageRelationStatistics Valid=205, Invalid=2152, Unknown=3, NotChecked=190, Total=2550 [2024-11-09 05:10:28,399 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:10:28,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 454 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 05:10:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 05:10:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-09 05:10:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 85 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:10:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2024-11-09 05:10:28,403 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 28 [2024-11-09 05:10:28,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:10:28,404 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2024-11-09 05:10:28,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 05:10:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2024-11-09 05:10:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 05:10:28,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:10:28,405 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:10:28,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 05:10:28,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 05:10:28,606 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:10:28,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:10:28,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1799725215, now seen corresponding path program 1 times [2024-11-09 05:10:28,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:10:28,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404265813] [2024-11-09 05:10:28,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:10:28,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:10:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:10:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:10:28,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:10:28,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404265813] [2024-11-09 05:10:28,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404265813] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:10:28,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237389761] [2024-11-09 05:10:28,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:10:28,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:10:28,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:10:28,801 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:10:28,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 05:10:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:10:28,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 05:10:28,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:10:29,251 INFO L378 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 19 treesize of output 1 [2024-11-09 05:10:29,269 INFO L378 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 19 treesize of output 1 [2024-11-09 05:10:29,367 INFO L378 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 [2024-11-09 05:10:29,536 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-09 05:10:29,537 INFO L378 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 44 treesize of output 38 [2024-11-09 05:10:29,999 INFO L378 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 [2024-11-09 05:10:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:10:30,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:10:30,310 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 05:10:30,310 INFO L378 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 12 treesize of output 11 [2024-11-09 05:10:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 05:10:30,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237389761] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:10:30,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1914007017] [2024-11-09 05:10:30,544 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 05:10:30,544 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:10:30,545 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:10:30,545 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:10:30,545 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:10:36,837 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 1 for LOIs [2024-11-09 05:10:36,850 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:11:18,267 WARN L286 SmtUtils]: Spent 7.35s on a formula simplification. DAG size of input: 283 DAG size of output: 264 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:11:46,123 WARN L286 SmtUtils]: Spent 17.42s on a formula simplification. DAG size of input: 308 DAG size of output: 289 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:11:53,070 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5732#(exists ((|v_ULTIMATE.start_destroy_~l#1.base_28| Int)) (and (or (not (= |v_ULTIMATE.start_destroy_~l#1.base_28| 0)) (not (= |ULTIMATE.start_destroy_~l#1.offset| 0))) (not (= (select |#valid| |v_ULTIMATE.start_destroy_~l#1.base_28|) 1))))' at error location [2024-11-09 05:11:53,070 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:11:53,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:11:53,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 6] total 20 [2024-11-09 05:11:53,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178227142] [2024-11-09 05:11:53,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:11:53,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 05:11:53,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:11:53,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 05:11:53,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1135, Unknown=18, NotChecked=0, Total=1260 [2024-11-09 05:11:53,073 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand has 20 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 05:11:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:11:55,891 INFO L93 Difference]: Finished difference Result 114 states and 144 transitions. [2024-11-09 05:11:55,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 05:11:55,892 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-11-09 05:11:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:11:55,893 INFO L225 Difference]: With dead ends: 114 [2024-11-09 05:11:55,893 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 05:11:55,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 78.2s TimeCoverageRelationStatistics Valid=175, Invalid=1695, Unknown=22, NotChecked=0, Total=1892 [2024-11-09 05:11:55,895 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 42 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:11:55,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 316 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 05:11:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 05:11:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2024-11-09 05:11:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.471264367816092) internal successors, (128), 99 states have internal predecessors, (128), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:11:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 134 transitions. [2024-11-09 05:11:55,900 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 134 transitions. Word has length 29 [2024-11-09 05:11:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:11:55,901 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 134 transitions. [2024-11-09 05:11:55,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 05:11:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 134 transitions. [2024-11-09 05:11:55,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:11:55,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:11:55,902 INFO L215 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] [2024-11-09 05:11:55,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 05:11:56,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 05:11:56,103 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:11:56,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:11:56,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1464041239, now seen corresponding path program 1 times [2024-11-09 05:11:56,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:11:56,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312210894] [2024-11-09 05:11:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:11:56,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:11:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:11:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:11:57,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:11:57,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312210894] [2024-11-09 05:11:57,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312210894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:11:57,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957086156] [2024-11-09 05:11:57,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:11:57,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:11:57,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:11:57,227 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:11:57,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 05:11:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:11:57,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-09 05:11:57,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:11:57,426 INFO L378 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 [2024-11-09 05:11:57,453 INFO L378 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 [2024-11-09 05:11:57,869 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:11:57,869 INFO L378 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 15 [2024-11-09 05:11:57,951 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:11:57,951 INFO L378 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 15 [2024-11-09 05:11:58,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-09 05:11:58,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-11-09 05:11:59,173 INFO L378 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 10 treesize of output 9 [2024-11-09 05:11:59,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:11:59,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:11:59,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 51 [2024-11-09 05:11:59,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:11:59,626 INFO L378 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 21 treesize of output 19 [2024-11-09 05:11:59,685 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:11:59,685 INFO L378 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 [2024-11-09 05:12:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:12:00,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:12:00,614 INFO L378 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 10 treesize of output 8 [2024-11-09 05:12:01,506 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_1197 (Array Int Int))) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1197))) (store .cse1 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.base|))) |c_ULTIMATE.start_create_~sll~0#1.base|))) (or (= |c_ULTIMATE.start_create_~sll~0#1.base| (select .cse0 0)) (= (select .cse0 8) 0)))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((v_ArrVal_1197 (Array Int Int))) (= |c_ULTIMATE.start_create_~sll~0#1.base| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1197))) (store .cse2 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.base|))) |c_ULTIMATE.start_create_~sll~0#1.base|) 0))) (forall ((v_ArrVal_1200 Int) (v_ArrVal_1198 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1198))) (store .cse3 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_1200))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0))))) is different from false [2024-11-09 05:12:01,577 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((v_ArrVal_1200 Int) (v_ArrVal_1198 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1198) |c_ULTIMATE.start_create_#t~ret4#1.base|) |c_ULTIMATE.start_create_#t~ret4#1.offset| v_ArrVal_1200) 8) 0)) (forall ((v_ArrVal_1197 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~ret4#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1197) |c_ULTIMATE.start_create_#t~ret4#1.base|) |c_ULTIMATE.start_create_#t~ret4#1.offset| |ULTIMATE.start_create_~data~0#1.base|) 0))))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_1197 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1197) |c_ULTIMATE.start_create_#t~ret4#1.base|) |c_ULTIMATE.start_create_#t~ret4#1.offset| |ULTIMATE.start_create_~data~0#1.base|))) (or (= |c_ULTIMATE.start_create_#t~ret4#1.base| (select .cse0 0)) (= (select .cse0 8) 0))))) is different from false [2024-11-09 05:12:01,773 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.base| Int) (v_ArrVal_1197 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1197) |c_alloc_and_zero_#res.base|) |c_alloc_and_zero_#res.offset| |ULTIMATE.start_create_~data~0#1.base|))) (or (= |c_alloc_and_zero_#res.base| (select .cse0 0)) (= (select .cse0 8) 0)))) (forall ((|ULTIMATE.start_create_~data~0#1.base| Int)) (or (forall ((v_ArrVal_1200 Int) (v_ArrVal_1198 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1198) |c_alloc_and_zero_#res.base|) |c_alloc_and_zero_#res.offset| v_ArrVal_1200) 8) 0)) (forall ((v_ArrVal_1197 (Array Int Int))) (= |c_alloc_and_zero_#res.base| (select (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1197) |c_alloc_and_zero_#res.base|) |c_alloc_and_zero_#res.offset| |ULTIMATE.start_create_~data~0#1.base|) 0)))))) is different from false [2024-11-09 05:12:01,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:12:01,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-09 05:12:01,820 INFO L378 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 38 treesize of output 34 [2024-11-09 05:12:01,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:12:01,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-09 05:12:01,854 INFO L378 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 38 treesize of output 34 [2024-11-09 05:12:01,870 INFO L378 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 20 [2024-11-09 05:12:01,877 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:12:01,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:12:01,911 INFO L378 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 23 [2024-11-09 05:12:01,928 INFO L378 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 20 [2024-11-09 05:12:01,972 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 05:12:01,972 INFO L378 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 32 treesize of output 29 [2024-11-09 05:12:02,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:12:02,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957086156] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:12:02,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [341742139] [2024-11-09 05:12:02,021 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-09 05:12:02,021 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:12:02,022 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:12:02,022 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:12:02,022 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:12:02,760 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2024-11-09 05:12:02,772 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:12:21,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [341742139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:12:21,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:12:21,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [13, 15, 15] total 50 [2024-11-09 05:12:21,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186291979] [2024-11-09 05:12:21,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:12:21,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 05:12:21,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:12:21,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 05:12:21,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1975, Unknown=4, NotChecked=276, Total=2450 [2024-11-09 05:12:21,605 INFO L87 Difference]: Start difference. First operand 105 states and 134 transitions. Second operand has 22 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:12:24,059 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] [2024-11-09 05:12:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:12:30,639 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2024-11-09 05:12:30,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 05:12:30,640 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-09 05:12:30,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:12:30,640 INFO L225 Difference]: With dead ends: 112 [2024-11-09 05:12:30,641 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 05:12:30,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=195, Invalid=1975, Unknown=4, NotChecked=276, Total=2450 [2024-11-09 05:12:30,642 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:12:30,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 763 Invalid, 1 Unknown, 0 Unchecked, 9.0s Time] [2024-11-09 05:12:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 05:12:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2024-11-09 05:12:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.4666666666666666) internal successors, (132), 102 states have internal predecessors, (132), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:12:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 138 transitions. [2024-11-09 05:12:30,647 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 138 transitions. Word has length 31 [2024-11-09 05:12:30,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:12:30,648 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 138 transitions. [2024-11-09 05:12:30,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:12:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 138 transitions. [2024-11-09 05:12:30,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:12:30,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:12:30,649 INFO L215 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] [2024-11-09 05:12:30,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 05:12:30,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 05:12:30,850 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:12:30,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:12:30,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1464024454, now seen corresponding path program 1 times [2024-11-09 05:12:30,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:12:30,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771770560] [2024-11-09 05:12:30,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:30,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:12:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:12:32,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:12:32,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771770560] [2024-11-09 05:12:32,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771770560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:12:32,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615952718] [2024-11-09 05:12:32,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:12:32,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:12:32,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:12:32,203 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:12:32,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 05:12:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:12:32,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 05:12:32,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:12:33,338 INFO L378 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 15 treesize of output 1 [2024-11-09 05:12:34,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:12:34,018 INFO L378 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 30 [2024-11-09 05:12:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:12:36,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:12:37,541 INFO L378 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 88 treesize of output 80 [2024-11-09 05:12:39,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615952718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:12:39,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1701604833] [2024-11-09 05:12:39,165 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2024-11-09 05:12:39,165 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:12:39,166 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:12:39,168 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:12:39,168 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:12:40,016 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2024-11-09 05:12:40,028 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:13:14,788 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6639#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_190| (Array Int (Array Int Int))) (|v_ULTIMATE.start_destroy_~l#1.base_38| Int) (|v_#memory_int_191| (Array Int (Array Int Int))) (|v_#memory_int_192| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_219| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_227| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_225| (Array Int (Array Int Int))) (|v_#valid_204| (Array Int Int)) (|v_#memory_$Pointer$.offset_221| (Array Int (Array Int Int))) (|v_#length_167| (Array Int Int))) (and (= (select |v_#valid_204| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0)) 0) (= |v_#memory_int_192| (store |v_#memory_int_191| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0) (store (select |v_#memory_int_191| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0)) 0 (select (select |v_#memory_int_192| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0)) 0)))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0) 1) |#StackHeapBarrier|) (= (store (store |v_#memory_$Pointer$.base_225| |v_ULTIMATE.start_destroy_~l#1.base_38| (store (select |v_#memory_$Pointer$.base_225| |v_ULTIMATE.start_destroy_~l#1.base_38|) 8 0)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0) (store (select (store |v_#memory_$Pointer$.base_225| |v_ULTIMATE.start_destroy_~l#1.base_38| (store (select |v_#memory_$Pointer$.base_225| |v_ULTIMATE.start_destroy_~l#1.base_38|) 8 0)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0)) 0 (select (select |v_#memory_$Pointer$.base_227| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0)) 0))) |v_#memory_$Pointer$.base_227|) (= (store (store |v_#valid_204| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0) 0) |v_ULTIMATE.start_destroy_~l#1.base_38| 0) |#valid|) (= |#length| (store (store |v_#length_167| |v_ULTIMATE.start_destroy_~l#1.base_38| 16) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0) 4)) (<= 16 (select |#length| |v_ULTIMATE.start_destroy_~l#1.base_38|)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_221| |v_ULTIMATE.start_destroy_~l#1.base_38| (store (select |v_#memory_$Pointer$.offset_221| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0 0))) (<= (+ |v_ULTIMATE.start_destroy_~l#1.base_38| 1) |#StackHeapBarrier|) (= (store (store |v_#memory_$Pointer$.offset_219| |v_ULTIMATE.start_destroy_~l#1.base_38| (store (select |v_#memory_$Pointer$.offset_219| |v_ULTIMATE.start_destroy_~l#1.base_38|) 8 0)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0) (store (select (store |v_#memory_$Pointer$.offset_219| |v_ULTIMATE.start_destroy_~l#1.base_38| (store (select |v_#memory_$Pointer$.offset_219| |v_ULTIMATE.start_destroy_~l#1.base_38|) 8 0)) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_221| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0)) 0))) |v_#memory_$Pointer$.offset_221|) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0) 0)) (= (store |v_#memory_int_190| |v_ULTIMATE.start_destroy_~l#1.base_38| (store (select |v_#memory_int_190| |v_ULTIMATE.start_destroy_~l#1.base_38|) 8 (select (select |v_#memory_int_191| |v_ULTIMATE.start_destroy_~l#1.base_38|) 8))) |v_#memory_int_191|) (= (store |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_destroy_~l#1.base_38| (store (select |v_#memory_$Pointer$.base_227| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0))) |#memory_$Pointer$.base|) (not (= |v_ULTIMATE.start_destroy_~l#1.base_38| 0)) (<= (select (select |v_#memory_int_192| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0)) 0) 2147483647) (= (select |v_#valid_204| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0) (= |#memory_int| (store |v_#memory_int_192| |v_ULTIMATE.start_destroy_~l#1.base_38| (store (select |v_#memory_int_192| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0 (select (select |#memory_int| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0)))) (<= 0 (+ (select (select |v_#memory_int_192| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_38|) 0)) 0) 2147483648)))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_10| (Array Int Int))) (and (= (select |v_ULTIMATE.start_main_old_#valid#1_10| 0) 0) (not (= |v_ULTIMATE.start_main_old_#valid#1_10| |#valid|)))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-09 05:13:14,788 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:13:14,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:13:14,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 24 [2024-11-09 05:13:14,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827356067] [2024-11-09 05:13:14,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:13:14,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 05:13:14,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:13:14,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 05:13:14,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=3142, Unknown=1, NotChecked=0, Total=3306 [2024-11-09 05:13:14,790 INFO L87 Difference]: Start difference. First operand 108 states and 138 transitions. Second operand has 26 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 22 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:13:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:13:20,453 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2024-11-09 05:13:20,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 05:13:20,454 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 22 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-09 05:13:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:13:20,455 INFO L225 Difference]: With dead ends: 121 [2024-11-09 05:13:20,455 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 05:13:20,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 41.9s TimeCoverageRelationStatistics Valid=240, Invalid=4315, Unknown=1, NotChecked=0, Total=4556 [2024-11-09 05:13:20,457 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 29 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:13:20,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 488 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 877 Invalid, 2 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 05:13:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 05:13:20,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2024-11-09 05:13:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.4375) internal successors, (138), 108 states have internal predecessors, (138), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:13:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 144 transitions. [2024-11-09 05:13:20,462 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 144 transitions. Word has length 31 [2024-11-09 05:13:20,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:13:20,463 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 144 transitions. [2024-11-09 05:13:20,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 22 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 05:13:20,463 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 144 transitions. [2024-11-09 05:13:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 05:13:20,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:13:20,464 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:13:20,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 05:13:20,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:20,665 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-09 05:13:20,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:13:20,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1017793160, now seen corresponding path program 2 times [2024-11-09 05:13:20,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:13:20,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173329462] [2024-11-09 05:13:20,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:13:20,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:13:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:13:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:13:23,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:13:23,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173329462] [2024-11-09 05:13:23,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173329462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:13:23,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860284403] [2024-11-09 05:13:23,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:13:23,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:13:23,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:13:23,299 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:13:23,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b303936-588e-4f79-a3d1-3f6121468539/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 05:13:23,515 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 05:13:23,515 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:13:23,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 05:13:23,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:13:23,779 INFO L378 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 [2024-11-09 05:13:23,787 INFO L378 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 [2024-11-09 05:13:24,008 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:13:24,008 INFO L378 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 [2024-11-09 05:13:24,246 INFO L378 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 29 treesize of output 17 [2024-11-09 05:13:24,269 INFO L378 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 29 treesize of output 17 [2024-11-09 05:13:24,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:13:24,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:13:24,739 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 05:13:24,739 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 62 [2024-11-09 05:13:24,792 INFO L349 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2024-11-09 05:13:24,792 INFO L378 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 1 case distinctions, treesize of input 55 treesize of output 30 [2024-11-09 05:13:26,123 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:13:26,126 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:13:26,158 INFO L349 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2024-11-09 05:13:26,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2024-11-09 05:13:26,198 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 05:13:26,198 INFO L378 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 1 case distinctions, treesize of input 33 treesize of output 16 [2024-11-09 05:13:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:13:26,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:13:37,903 INFO L349 Elim1Store]: treesize reduction 257, result has 53.4 percent of original size [2024-11-09 05:13:37,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 1735 treesize of output 1344 [2024-11-09 05:13:39,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:13:39,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 3834 treesize of output 3957 [2024-11-09 05:13:43,818 INFO L349 Elim1Store]: treesize reduction 949, result has 50.2 percent of original size [2024-11-09 05:13:43,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 30 case distinctions, treesize of input 4498 treesize of output 3945 [2024-11-09 05:13:45,400 INFO L224 Elim1Store]: Index analysis took 178 ms [2024-11-09 05:13:47,695 INFO L349 Elim1Store]: treesize reduction 968, result has 27.9 percent of original size [2024-11-09 05:13:47,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 39 case distinctions, treesize of input 4656 treesize of output 4888 [2024-11-09 05:13:49,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-09 05:13:51,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4